Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
Artificial Intelligence
2021-09-20 v1 Programming Languages
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.
Cite
@article{arxiv.2109.08293,
title = {Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat},
author = {Neng-Fa Zhou},
journal= {arXiv preprint arXiv:2109.08293},
year = {2021}
}
Comments
In Proceedings ICLP 2021, arXiv:2109.07914