New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability

DOI10.1016/j.disopt.2006.10.012zbMath1140.68492OpenAlexW2021747739MaRDI QIDQ937398

Andrea Santori, Renato Bruni

Publication date: 15 August 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.012

zbMATH Keywords

satisfiabilitybranching rulesconflict-based search frameworks

Mathematics Subject Classification ID

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

Uses Software

• zChaff
• Chaff
• BerkMin
• Leibniz

Cites Work

• Solving propositional satisfiability problems
• On the complexity of choosing the branching literal in DPLL
• BerkMin: A fast and robust SAT-solver
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability