3 papers
cs.DS2025
Uncrossed Multiflows and Applications to Disjoint Paths
Chandra Chekuri, Guyslain Naves, Joseph Poremba +1
A multiflow in a planar graph is uncrossed if its support paths do not cross. Recently such flows have played a role in approximation algorithms for maximum disjoint paths in "full…
cs.SE2024
Portus: Linking Alloy with SMT-based Finite Model Finding
Ryan Dancy, Nancy A. Day, Owen Zila +2
Alloy is a well-known, formal, declarative language for modelling systems early in the software development process. Currently, it uses the Kodkod library as a back-end for finite…
cs.LO2020
Static Symmetry Breaking in Many-Sorted Finite Model Finding
Joseph Poremba
Symmetry in finite model finding problems of many-sorted first-order logic (MSFOL) can be exploited to reduce the number of interpretations considered during search, thereby improv…