Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat (2109.08293v1)

Published 17 Sep 2021 in cs.AI and cs.PL

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.

Citations (2)

View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Generate a whiteboard explanation of this paper.

Sign Up to Generate

Video Overview

Generate a video overview of this paper.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Neng-Fa Zhou

Collections

Sign up for free to add this paper to one or more collections.