Machine learning for automated theorem proving: Learning to solve SAT and QSAT
SB Holden - Foundations and Trends® in Machine Learning, 2021 - nowpublishers.com
The decision problem for Boolean satisfiability, generally referred to as SAT, is the
archetypal NP-complete problem, and encodings of many problems of practical interest exist …
archetypal NP-complete problem, and encodings of many problems of practical interest exist …
Satisfiability modulo theories
Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
DepQBF: A dependency-aware QBF solver
Abstract We present DepQBF 0.1, a new search-based solver for quantified boolean
formulae (QBF). It integrates compact dependency graphs to overcome the restrictions …
formulae (QBF). It integrates compact dependency graphs to overcome the restrictions …
Quantified boolean formulas
Solvers for quantified Boolean formulas (QBF) have become powerful tools for tackling hard
computational problems from various application domains, even beyond the scope of SAT …
computational problems from various application domains, even beyond the scope of SAT …
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL
F Lonsing, U Egly - Automated Deduction–CADE 26: 26th International …, 2017 - Springer
We present the latest major release version 6.0 of the quantified Boolean formula (QBF)
solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven …
solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven …
[HTML][HTML] Expansion-based QBF solving versus Q-resolution
This article introduces and studies a proof system∀ Exp+ Res that enables us to refute
quantified Boolean formulas (QBFs). The system∀ Exp+ Res operates in two stages: it …
quantified Boolean formulas (QBFs). The system∀ Exp+ Res operates in two stages: it …
Contributions to the theory of practical quantified Boolean formula solving
A Van Gelder - International Conference on Principles and Practice of …, 2012 - Springer
Recent solvers for quantified boolean formulas (QBFs) use a clause learning method based
on a procedure proposed by Giunchiglia et al.(JAIR 2006), which avoids creating …
on a procedure proposed by Giunchiglia et al.(JAIR 2006), which avoids creating …
Abstraction-based algorithm for 2QBF
Abstract Quantified Boolean Formulas (QBFs) enable standard representation of PSPACE
problems. In particular, formulas with two quantifier levels (2QBFs) enable representing …
problems. In particular, formulas with two quantifier levels (2QBFs) enable representing …
Long-distance resolution: Proof generation and strategy extraction in search-based QBF solving
U Egly, F Lonsing, M Widl - … -19, Stellenbosch, South Africa, December 14 …, 2013 - Springer
Strategies (and certificates) for quantified Boolean formulas (QBFs) are of high practical
relevance as they facilitate the verification of results returned by QBF solvers and the …
relevance as they facilitate the verification of results returned by QBF solvers and the …
On unification of QBF resolution-based calculi
Several calculi for quantified Boolean formulas (QBFs) exist, but relations between them are
not yet fully understood. This paper defines a novel calculus, which is resolution-based and …
not yet fully understood. This paper defines a novel calculus, which is resolution-based and …