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.

中文翻译：

---

在 Picat 中使用 SAT 编码的可达性约束对图合成问题进行建模和求解

许多约束满足问题涉及合成满足某些可达性约束的子图。本文介绍了从最近的 LP/CP 编程竞赛中选出的四个问题的 Picat 程序。这些程序展示了 Picat 语言的建模能力以及配备有效编码的尖端 SAT 求解器的求解效率。