Proof complexity and SAT solving
S Buss, J Nordström - Handbook of Satisfiability, 2021 - ebooks.iospress.nl
This chapter gives an overview of proof complexity and connections to SAT solving, focusing
on proof systems such as resolution, Nullstellensatz, polynomial calculus, and cutting planes …
on proof systems such as resolution, Nullstellensatz, polynomial calculus, and cutting planes …
The silent (r) evolution of SAT
The Silent (R)evolution of SAT Page 1 THE PROPOSITIONAL SATISFIABILITY problem (SAT)
was the first to be shown NP-complete by Cook and Levin. SAT remained the embodiment of …
was the first to be shown NP-complete by Cook and Levin. SAT remained the embodiment of …
CNFgen: A generator of crafted benchmarks
We present CNFgen, a generator of combinatorial benchmarks in DIMACS and OPB format.
The proof complexity literature is a rich source not only of hard instances but also of …
The proof complexity literature is a rich source not only of hard instances but also of …
HyQSAT: A hybrid approach for 3-SAT problems by integrating quantum annealer with CDCL
Propositional satisfiability problem (SAT) is represented in a conjunctive normal form with
multiple clauses, which is an important non-deterministic polynomial-time (NP) complete …
multiple clauses, which is an important non-deterministic polynomial-time (NP) complete …
Advancing lazy-grounding ASP solving techniques–restarts, phase saving, heuristics, and more
Answer-Set Programming (ASP) is a powerful and expressive knowledge representation
paradigm with a significant number of applications in logic-based AI. The traditional ground …
paradigm with a significant number of applications in logic-based AI. The traditional ground …
: gazing in the black box of SAT solving
Boolean satisfiability is a fundamental problem in computer science with a wide range of
applications including planning, configuration management, design and verification of …
applications including planning, configuration management, design and verification of …
Hard examples for common variable decision heuristics
M Vinyals - Proceedings of the AAAI Conference on Artificial …, 2020 - ojs.aaai.org
The CDCL algorithm for SAT is equivalent to the resolution proof system under a few
assumptions, one of them being an optimal non-deterministic procedure for choosing the …
assumptions, one of them being an optimal non-deterministic procedure for choosing the …
[HTML][HTML] QCDCL with cube learning or pure literal elimination–What is best?
Quantified conflict-driven clause learning (QCDCL) is one of the main approaches for
solving quantified Boolean formulas (QBF). We formalise and investigate several versions of …
solving quantified Boolean formulas (QBF). We formalise and investigate several versions of …
Approximate counting of minimal unsatisfiable subsets
Given an unsatisfiable formula F in CNF, ie a set of clauses, the problem of Minimal
Unsatisfiable Subset (MUS) seeks to identify a minimal subset of clauses N ⊆ F such that N …
Unsatisfiable Subset (MUS) seeks to identify a minimal subset of clauses N ⊆ F such that N …
Parallel Empirical Evaluations: Resilience despite Concurrency
Computational evaluations are crucial in modern problem-solving when we surpass
theoretical algorithms or bounds. These experiments frequently take much work, and the …
theoretical algorithms or bounds. These experiments frequently take much work, and the …