On Freezing and Reactivating Learnt Clauses

DOI10.1007/978-3-642-21581-0_16zbMath1330.68267OpenAlexW189838518MaRDI QIDQ3007683

Bertrand Mazure, Jean-Marie Lagniez, Gilles Audemard, Lakhdar Saïs

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_16

Mathematics Subject Classification ID

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

Related Items (4)

What we can learn from conflicts in propositional satisfiability ⋮ Between SAT and UNSAT: The Fundamental Difference in CDCL SAT ⋮ An Expressive Model for Instance Decomposition Based Parallel SAT Solvers ⋮ Learning from conflicts in propositional satisfiability

Uses Software

• MiniSat
• Chaff

Cites Work

• Unnamed Item
• A Generalized Framework for Conflict Analysis
• Blocked Clause Elimination
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

This page was built for publication: On Freezing and Reactivating Learnt Clauses