Generalized Conflict-Clause Strengthening for Satisfiability Solvers

DOI10.1007/978-3-642-21581-0_26zbMath1330.68278OpenAlexW16528894MaRDI QIDQ3007694

Allen van Gelder

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_26

Mathematics Subject Classification ID

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

Related Items

ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver ⋮ Efficient all-UIP learned clause minimization

Uses Software

• MiniSat
• Chaff
• PicoSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Generalized Framework for Conflict Analysis
• Unit Refutations and Horn Sets
• Theory and Applications of Satisfiability Testing
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving

This page was built for publication: Generalized Conflict-Clause Strengthening for Satisfiability Solvers