Limitations of Restricted Branching in Clause Learning

DOI10.1007/978-3-540-74970-7_26zbMath1145.68517OpenAlexW2604583808MaRDI QIDQ3523067

Matti Järvisalo, Tommi Junttila

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_26

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Learning pseudo-backdoors for mixed integer programs ⋮ Limitations of Restricted Branching in Clause Learning ⋮ Limitations of restricted branching in clause learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unrestricted vs restricted cut in a tableau method for Boolean circuits
• The intractability of resolution
• Regular Resolution Versus Unrestricted Resolution
• Limitations of Restricted Branching in Clause Learning
• The relative efficiency of propositional proof systems
• GRASP: a search algorithm for propositional satisfiability
• The Complexity of Propositional Proofs
• Theory and Applications of Satisfiability Testing
• Formal Methods in Computer-Aided Design
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving

This page was built for publication: Limitations of Restricted Branching in Clause Learning