Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 403-414
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Improved Exact Solvers for Weighted Max-SATLecture Notes in Computer Science, 2005
- A Max-SAT Solver with Lazy Data StructuresLecture Notes in Computer Science, 2004
- Solving Max-SAT as Weighted CSPLecture Notes in Computer Science, 2003
- Current Approaches for Solving Over-Constrained ProblemsConstraints, 2003
- New Upper Bounds for Maximum SatisfiabilityJournal of Algorithms, 2000
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT ProblemsJournal of Combinatorial Optimization, 1998
- Look-ahead versus look-back for satisfiability problems1997
- Branching rules for satisfiabilityJournal of Automated Reasoning, 1995
- Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1990