In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving

DOI10.1007/978-3-319-94144-8_18OpenAlexW2810460597MaRDI QIDQ1656587

Jakob Nordström, Jan Elffers, Jesús Giráldez-Cru, Marc Vinyals, Stephan Gocht

Publication date: 10 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94144-8_18

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (6)

Optimal length cutting plane refutations of integer programs ⋮ Unnamed Item ⋮ Constrained pseudo-propositional logic ⋮ Propositional proof systems based on maximum satisfiability ⋮ Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search ⋮ On dedicated CDCL strategies for PB solvers

This page was built for publication: In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving