Revisiting hyper binary resolution

DOI10.1007/978-3-642-38171-3_6MaRDI QIDQ4922905zbMATH OpenOpenAlexFDO

Authors Marijn J. H. Heule, Matti Järvisalo, Armin Biere

Publication date 4 June 2013

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38171-3_6

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Anatomy and empirical evaluation of modern SAT solvers
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 2090309
• scientific article; zbMATH DE number 1903342
• Empirical study of the anatomy of modern SAT solvers

Cited in

(2)

• SAT solving using XOR-OR-AND normal forms.
• Clausal congruence closure

This page was built for publication: Revisiting hyper binary resolution

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