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

09/17/2021
by   Neng-Fa Zhou, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset