Emergent Mind
Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
(2109.08293)
Published Sep 17, 2021
in
cs.AI
and
cs.PL
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.