Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination

We introduce novel methods for encoding acyclicity and s-t-reachability constraints for propositional formulas with underlying directed graphs. They are based on vertex elimination graphs, which makes them suitable for cases where the underlying graph is sparse. In contrast to solvers with ad hoc constraint propagators for acyclicity and reachability constraints such as GraphSAT, our methods encode these constraints as standard propositional clauses, making them directly applicable with any SAT solver. An empirical study demonstrates that our methods together with an efficient SAT solver can outperform both earlier encodings of these constraints as well as GraphSAT, particularly when underlying graphs are sparse.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2023

Proof Generation for CDCL Solvers Using Gauss-Jordan Elimination

Traditional Boolean satisfiability (SAT) solvers based on the conflict-d...
research
07/11/2019

On the Tour Towards DPLL(MAPF) and Beyond

We discuss milestones on the tour towards DPLL(MAPF), a multi-agent path...
research
09/17/2021

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

Many constraint satisfaction problems involve synthesizing subgraphs tha...
research
01/30/2020

Parity (XOR) Reasoning for the Index Calculus Attack

Models for cryptographic problems are often expressed as boolean polynom...
research
11/11/2022

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets

We propose a new approach to the Directed Feedback Vertex Set Problem (D...
research
04/19/2020

An Algorithm for the Exact Treedepth Problem

We present a novel algorithm for the minimum-depth elimination tree prob...
research
08/09/2021

Modal Logic S5 Satisfiability in Answer Set Programming

Modal logic S5 has attracted significant attention and has led to severa...

Please sign up or login with your details

Forgot password? Click here to reset