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 …
[PDF][PDF] Divide and Conquer: Towards Faster Pseudo-Boolean Solving.
J Elffers, J Nordström - IJCAI, 2018 - it.uu.se
Divide and Conquer: Towards Faster Pseudo-Boolean Solving Page 1 Divide and Conquer:
Towards Faster Pseudo-Boolean Solving Jan Elffers KTH Royal Institute of Technology …
Towards Faster Pseudo-Boolean Solving Jan Elffers KTH Royal Institute of Technology …
Cutting to the core of pseudo-boolean optimization: Combining core-guided search with cutting planes reasoning
Core-guided techniques have revolutionized Boolean satisfiability approaches to
optimization problems (MaxSAT), but the process at the heart of these methods …
optimization problems (MaxSAT), but the process at the heart of these methods …
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 …
[HTML][HTML] Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending
the conflict-driven clause learning (CDCL) paradigm from SAT solving. Though pseudo …
the conflict-driven clause learning (CDCL) paradigm from SAT solving. Though pseudo …
A generalized method for proving polynomial calculus degree lower bounds
M Mikša, J Nordström - arXiv preprint arXiv:1505.01358, 2015 - arxiv.org
We study the problem of obtaining lower bounds for polynomial calculus (PC) and
polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al.'99] …
polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al.'99] …
Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
J Elffers, J Giráldez-Cru, J Nordström… - … SAT 2018, Held as Part of …, 2018 - Springer
We study cdcl-cuttingplanes, Open-WBO, and Sat4j, three successful solvers from the
Pseudo-Boolean Competition 2016, and evaluate them by performing experiments on …
Pseudo-Boolean Competition 2016, and evaluate them by performing experiments on …
Propositional proof systems based on maximum satisfiability
The paper describes the use of dual-rail MaxSAT systems to solve Boolean satisfiability
(SAT), namely to determine if a set of clauses is satisfiable. The MaxSAT problem is the …
(SAT), namely to determine if a set of clauses is satisfiable. The MaxSAT problem is the …
On weakening strategies for PB solvers
D Le Berre, P Marquis, R Wallon - … of Satisfiability Testing–SAT 2020: 23rd …, 2020 - Springer
Current pseudo-Boolean solvers implement different variants of the cutting planes proof
system to infer new constraints during conflict analysis. One of these variants is generalized …
system to infer new constraints during conflict analysis. One of these variants is generalized …
[PDF][PDF] On Division Versus Saturation in Pseudo-Boolean Solving.
On Division Versus Saturation in Pseudo-Boolean Solving Page 1 On Division Versus Saturation
in Pseudo-Boolean Solving Stephan Gocht, Jakob Nordström, Amir Yehudayoff 21.05.2019 …
in Pseudo-Boolean Solving Stephan Gocht, Jakob Nordström, Amir Yehudayoff 21.05.2019 …