Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers

DOI10.1007/978-3-319-94144-8_5MaRDI QIDQ1656563zbMATH OpenOpenAlexFDO

Authors Jan Elffers, Jesús Giráldez-Cru, Jakob Nordstrom, Marc Vinyals

Publication date 10 August 2018

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
• scientific article; zbMATH DE number 5139167
• On using cutting planes in pseudo-Boolean optimization
• scientific article; zbMATH DE number 5139165
• Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques

Cited in

(9)

• On dedicated CDCL strategies for PB solvers
• Efficient local search for pseudo Boolean optimization
• In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
• scientific article; zbMATH DE number 5139165 (Why is no real title available?)
• Clausal proofs for pseudo-Boolean reasoning
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
• scientific article; zbMATH DE number 5139167 (Why is no real title available?)
• scientific article; zbMATH DE number 7455719 (Why is no real title available?)
• Understanding cutting planes for QBFs

This page was built for publication: Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1656563)