AI Chat AI Image Generator AI Video Text to Speech

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

09/17/2021

∙

by Neng-Fa Zhou, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 08/25/2015

Unsatisfiable Cores and Lower Bounding for Constraint Programming

Constraint Programming (CP) solvers typically tackle optimization proble...

0 Nicholas Downing, et al. ∙

research

∙ 01/18/2014

Local Consistency and SAT-Solvers

Local consistency techniques such as k-consistency are a key component o...

0 Peter Jeavons, et al. ∙

research

∙ 05/27/2021

Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination

We introduce novel methods for encoding acyclicity and s-t-reachability ...

0 Masood Feyzbakhsh Rankooh, et al. ∙

research

∙ 09/01/2019

On-the-Fly Construction of Composite Events in Scenario-Based Modeling using Constraint Solvers

Scenario-Based Programming is a methodology for modeling and constructin...

0 Guy Katz, et al. ∙

research

∙ 07/26/2012

On When and How to use SAT to Mine Frequent Itemsets

A new stream of research was born in the last decade with the goal of mi...

0 Rui Henriques, et al. ∙

research

∙ 12/06/2010

URSA: A System for Uniform Reduction to SAT

There are a huge number of problems, from various areas, being solved by...

0 Predrag Janicic, et al. ∙

research

∙ 11/16/2020

Dependency Solving Is Still Hard, but We Are Getting Better at It

Dependency solving is a hard (NP-complete) problem in all non-trivial co...

0 Pietro Abate, et al. ∙