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 …
Bounded model checking
A Biere - Handbook of satisfiability, 2021 - ebooks.iospress.nl
One of the most important industrial applications of SAT is currently Bounded Model
Checking (BMC). This technique is typically used for formal hardware verification in the …
Checking (BMC). This technique is typically used for formal hardware verification in the …
CAQE: a certifying QBF solver
We present a new CEGAR-based algorithm for QBF. The algorithm builds on a
decomposition of QBFs into a sequence of propositional formulas, which we call the clausal …
decomposition of QBFs into a sequence of propositional formulas, which we call the clausal …
Practical applications of boolean satisfiability
J Marques-Silva - 2008 9th International Workshop on Discrete …, 2008 - ieeexplore.ieee.org
Boolean satisfiability (SAT) solvers have been the subject of remarkable improvements
since the mid 90s. One of the main reasons for these improvements has been the wide …
since the mid 90s. One of the main reasons for these improvements has been the wide …
Unified QBF certification and its applications
V Balabanov, JHR Jiang - Formal Methods in System Design, 2012 - Springer
Quantified Boolean formulae (QBF) allow compact encoding of many decision problems.
Their importance motivated the development of fast QBF solvers. Certifying the results of a …
Their importance motivated the development of fast QBF solvers. Certifying the results of a …
A survey on applications of quantified Boolean formulas
The decision problem of quantified Boolean formulas (QBFs) is the archetypical problem for
the complexity class PSPACE. Beside such theoretical aspects QBF also provides an …
the complexity class PSPACE. Beside such theoretical aspects QBF also provides an …
Algorithms for maximum satisfiability using unsatisfiable cores
J Marques-Silva, J Planes - Proceedings of the conference on Design …, 2008 - dl.acm.org
Many decision and optimization problems in Electronic Design Automation (EDA) can be
solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find …
solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find …
A self-adaptive multi-engine solver for quantified Boolean formulas
L Pulina, A Tacchella - Constraints, 2009 - Springer
In this paper we study the problem of engineering a robust solver for quantified Boolean
formulas (QBFs), ie, a tool that can efficiently solve formulas across different problem …
formulas (QBFs), ie, a tool that can efficiently solve formulas across different problem …
QBF resolution systems and their proof complexities
V Balabanov, M Widl, JHR Jiang - International Conference on Theory and …, 2014 - Springer
Quantified Boolean formula (QBF) evaluation has a broad range of applications in computer
science and is gaining increasing attention. Recent progress has shown that for a certain …
science and is gaining increasing attention. Recent progress has shown that for a certain …
Deciding effectively propositional logic using DPLL and substitution sets
We introduce a DPLL calculus that is a decision procedure for the Bernays-Schönfinkel
class, also known as EPR. Our calculus allows combining techniques for efficient …
class, also known as EPR. Our calculus allows combining techniques for efficient …