JSAT
2010
13 years 7 months ago
2010
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quan...
JSAT
2010
13 years 7 months ago
2010
This paper is devoted to investigate resolution for quantified generalized clause-sets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Ho...
JSAT
2010
13 years 7 months ago
2010
In this paper we outline QuBE7's main features, describing first the options of the preprocessors, and then giving some details about how the core search-based solver (i) per...
JSAT
2010
13 years 7 months ago
2010
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...
JSAT
2010
13 years 7 months ago
2010
Sat4j is a mature, open source library of SAT-based solvers in Java. It provides a modular SAT solver architecture designed to work with generic constraints. Such architecture is ...
JSAT
2010
13 years 7 months ago
2010
In this paper we describe aqme'10, the version of the Adaptive QBF Multi-Engine submitted to QBFEVAL'10.
JSAT
2010
13 years 7 months ago
2010
The design of a SAT-solver or the modification of an existing one is always followed by a phase of intensive testing of the solver on a benchmark of instances. This task can be ve...
JSAT
2010
13 years 7 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...