Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat

Authors :: Zhou, Neng-Fa
Source :: EPTCS 345, 2021, pp. 165-178
Publication Year :: 2021
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.<br />Comment: In Proceedings ICLP 2021, arXiv:2109.07914

Subjects :: Computer Science - Artificial Intelligence
Computer Science - Programming Languages
D.3.2

Full Text Access

Tools