URSA: A System for Uniform Reduction to SAT

12/06/2010
by   Predrag Janicic, et al.
0

There are a huge number of problems, from various areas, being solved by reducing them to SAT. However, for many applications, translation into SAT is performed by specialized, problem-specific tools. In this paper we describe a new system for uniform solving of a wide class of problems by reducing them to SAT. The system uses a new specification language URSA that combines imperative and declarative programming paradigms. The reduction to SAT is defined precisely by the semantics of the specification language. The domain of the approach is wide (e.g., many NP-complete problems can be simply specified and then solved by the system) and there are problems easily solvable by the proposed system, while they can be hardly solved by using other programming languages or constraint programming systems. So, the system can be seen not only as a tool for solving problems by reducing them to SAT, but also as a general-purpose constraint solving system (for finite domains). In this paper, we also describe an open-source implementation of the described approach. The performed experiments suggest that the system is competitive to state-of-the-art related modelling systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2017

A Refutation of Guinea's "Understanding SAT is in P"

In this work, we summarize and critique the paper "Understanding SAT is ...
research
01/16/2014

A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning

Diagrammatic reasoning (DR) is pervasive in human problem solving as a p...
research
08/27/2021

Positive Planar Satisfiability Problems under 3-Connectivity Constraints

A 3-SAT problem is called positive and planar if all the literals are po...
research
05/17/2018

Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems

In the present paper we describe the technology for translating algorith...
research
12/04/2012

An Empirical Evaluation of Portfolios Approaches for solving CSPs

Recent research in areas such as SAT solving and Integer Linear Programm...
research
08/04/2013

On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project

This paper proposes a method to estimate the total time required to solv...
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...

Please sign up or login with your details

Forgot password? Click here to reset