mlsanityData to 7 Oct 2026

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

arXiv 2109.08293 ↗First posted 17 Sep 2021cs.AI cs.PLcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 2 of its 29 references that are in the map. First posted on arXiv 17 Sep 2021.

Builds on

2 of 29 references.

References · 2

  1. 2014Local Consistency and SAT-Solverscited by 1
  2. 2015Declaratively solving Google Code Jam problems with Picatcited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.

  1. 2022Proceedings of the 2022 XCSP3 Competitioncited by 2