A Generalized Framework for Conflict Analysis

DOI10.1007/978-3-540-79719-7_3zbMath1138.68485OpenAlexW2142648466MaRDI QIDQ3502689

Youssef Hamadi, Lucas Bordeaux, Lakhdar Saïs, Gilles Audemard, Saïd Jabbour

Publication date: 27 May 2008

Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)

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

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

What we can learn from conflicts in propositional satisfiability, A Generalized Framework for Conflict Analysis, Learning from conflicts in propositional satisfiability, Dealing with satisfiability and \(n\)-ary CSPs in a logical framework, An overview of parallel SAT solving, On Freezing and Reactivating Learnt Clauses, Generalized Conflict-Clause Strengthening for Satisfiability Solvers, Producing and verifying extremely large propositional refutations, On the power of clause-learning SAT solvers as resolution engines, ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver

Uses Software

• MiniSat
• Chaff
• RSat

Cites Work

• Unnamed Item
• A Generalized Framework for Conflict Analysis
• Theory and Applications of Satisfiability Testing
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing