arXiv
Open Access
2021
Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
Neng-Fa Zhou
Abstrak
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.
Penulis (1)
N
Neng-Fa Zhou
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2021
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓