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

DOI10.1007/978-3-319-94144-8_5OpenAlexW2811247337MaRDI QIDQ1656563

Jakob Nordström, Jan Elffers, Jesús Giráldez-Cru, 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)

Related Items (5)

Unnamed Item ⋮ Understanding cutting planes for QBFs ⋮ Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search ⋮ On dedicated CDCL strategies for PB solvers ⋮ Efficient local search for pseudo Boolean optimization

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