URSA: A System for Uniform Reduction to SAT

@article{Janicic2012URSAAS,
  title={URSA: A System for Uniform Reduction to SAT},
  author={Predrag Janicic},
  journal={Logical Methods in Computer Science},
  year={2012},
  volume={8}
}
  • Predrag Janicic
  • Published 2012
  • Computer Science
  • Logical Methods in Computer Science
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… Expand
meSAT: multiple encodings of CSP to SAT
TLDR
This work presents a system that translates specifications of finite linear CSP problems into SAT instances using several well-known encodings, and their combinations, and a methodology for selecting a suitable encoding based on simple syntactic features of the input CSP instance. Expand
Parallel SAT solvers and their application in automatic parallelization
TLDR
SAT-PaDdlinG is a parallel DPLL SAT Solver on GPU, which allows RePaSAT to use this environment and aims at providing this massive parallelism and low cost to Re PaSAT, as well as to any other tool or problem that uses SAT Solvers. Expand
Proving Correctness of a KRK Chess Endgame Strategy by SAT-based Constraint Solving
TLDR
This is the first computer-assisted high-level proof of the correctness of a strategy for some chess endgame based on reduction to propositional logic, more precisely to SAT. Expand
Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT (Tool Paper)
TLDR
The Transalg system is designed to produce SAT encodings for discrete functions, written as programs in a specific language, based on propositional encoding methods for formal computing models and on the concept of symbolic execution. Expand
Encoding Cryptographic Functions to SAT Using TRANSALG System
TLDR
The technology for constructing propositional encodings of discrete functions aimed at solving inversion problems of considered functions using state-of-the-art SAT solvers is implemented, and the functionality of Transalg is compared in detail with that of similar software systems. Expand
Proving Correctness of a KRK Chess Endgame Strategy by Using Isabelle/HOL and Z3
TLDR
This work builds upon a previous computer-assisted correctness analysis performed using the constraint solver URSA and demonstrates that the synergy between the state-of-the-art automated and interactive theorem proving is mature enough so that very complex conjectures from various AI domains can be proved almost in a “push-button” manner, yet in a rich logical framework offered by the modern ITP systems. Expand
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
TLDR
The Transalg software system, developed with SAT-based cryptanalysis specifics in mind, is described and the results of applications of Transalg to construction of a number of attacks on various cryptographic functions are shown. Expand
Constructibility Classes for Triangle Location Problems
TLDR
This paper adapts the notion of reduction to geometric constructions in order to have geometric proofs for unconstructibility based on a set of problems known to be unconstructible. Expand
An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator
TLDR
An algorithm for constructing guess-and-determine attacks on keystream generators and applying it to the cryptanalysis of the alternating step generator (ASG) and two its modifications (MASG and MASG0). Expand
Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks
TLDR
This paper investigates one particular method for constructing guess-and-determine attacks based on evolutionary algorithms, and shows that using statistical tests within the comparator of fitness values, which can be used to reduce the necessary number of samples, speeds up the attack by a factor of 1.5 to 4.3 even on a distributed cluster. Expand
...
1
2
...

References

SHOWING 1-10 OF 93 REFERENCES
A System for Solving Constraint Satisfaction Problems with SMT
TLDR
A tool for translating FlatZinc (MiniZinc intermediate code) instances of constraint satisfaction problems to the standard SMT-LIB language is introduced and it is suggested that SMT can be effectively used to solve CSPs. Expand
Compiling Problem Specifications into SAT
TLDR
A compiler that translates a problem specification into a propositional satisfiability test (SAT) is presented, which is an executable specification language for all NP problems which shows interesting computational properties. Expand
Universal Booleanization of Constraint Models
TLDR
This work presents a translation of constraint models to SAT at language level, using the recently proposed constraint modeling language MiniZinc, such that any satisfaction or optimization problem written in the language can be automatically Booleanized and solved by one or more calls to a SAT solver. Expand
Formalization and Implementation of Modern SAT Solvers
  • Filip Marić
  • Computer Science
  • Journal of Automated Reasoning
  • 2009
TLDR
This paper uses a tutorial, top-down, approach and develops a SAT solver, starting from a simple design that is subsequently extended, step-by-step, with a requisite series of features. Expand
SAT-Based Answer Set Programming
TLDR
This paper presents a SAT-based decision procedure for answer set programming that deals with any (non disjunctive) logic program, works on a SAT formula without additional variables, and is guaranteed to work in polynomial space. Expand
URBiVA: Uniform Reduction to Bit-Vector Arithmetic
TLDR
A system URBiVA for specifying and solving a range of problems by uniformly reducing them to bit-vector arithmetic (bva) and can be used not only as a specification and solving tool, but also as a platform for evaluation and comparison between bva solvers. Expand
Evaluating ASP and Commercial Solvers on the CSPLib
TLDR
Results show that there is not a single solver winning on all problems, and that reformulation is almost always beneficial: symmetry-breaking may be a good choice, but its complexity has to be carefully chosen, by taking into account also the particular solver used. Expand
SAT as an Effective Solving Technology for Constraint Problems
TLDR
This paper solves many instances of several common benchmark problems for CP with different SAT solvers, by exploiting the declarative modelling language NPSpec, and Spec2Sat, an application that allows us to compile N PSpec specifications into SAT instances. Expand
A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains
TLDR
This paper compares the efficiency of a number of Constraint Logic Programming (CLP) systems in the setting of finite domains as well as a specific aspect of their expressiveness (that concerning reification and meta-constraints) to indicate their particular strengths and weaknesses. Expand
Compiling Constraints in clp(FD)
TLDR
The clp(FD) system is a Constraint Logic Programming language with finite domain constraints based on the use of a single primitive constraint X in r that embeds the core propagation mechanism and can be naturally enhanced with various new constraints such as constructive disjunction, boolean constraints, non-linear constraints and symbolic constraints. Expand
...
1
2
3
4
5
...