Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
arXiv:2109.08293 · doi:10.4204/EPTCS.345.30
Abstract
Many constraint satisfaction problems involve synthesizing subgraphs that satisfy certain reachability constraints. This paper presents programs in Picat for four problems selected from the recent LP/CP programming competitions. The programs demonstrate the modeling capabilities of the Picat language and the solving efficiency of the cutting-edge SAT solvers empowered with effective encodings.
In Proceedings ICLP 2021, arXiv:2109.07914