Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers

DOI10.1007/11564751_31zbMath1153.68470OpenAlexW1793843726MaRDI QIDQ3524192

Chu-Min Li, Jordi Planes, Felip Manyà

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_31

Mathematics Subject Classification ID

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

Related Items (20)

MaxSAT by improved instance-specific algorithm configuration ⋮ A logical approach to efficient Max-SAT solving ⋮ Resolution-based lower bounds in MaxSAT ⋮ Modelling Max-CSP as Partial Max-SAT ⋮ A Preprocessor for Max-SAT Solvers ⋮ A Max-SAT Inference-Based Pre-processing for Max-Clique ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ On Inconsistent Clause-Subsets for Max-SAT Solving ⋮ Breaking Cycle Structure to Improve Lower Bound for Max-SAT ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Optimizing with minimum satisfiability ⋮ Soft arc consistency revisited ⋮ Exact Max-SAT solvers for over-constrained problems ⋮ Understanding the power of Max-SAT resolution through up-resilience ⋮ Integrating multi-armed bandit with local search for MaxSAT ⋮ Exploiting Cycle Structures in Max-SAT ⋮ Resolution for Max-SAT ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver ⋮ Iterative and core-guided maxsat solving: a survey and assessment

Uses Software

• SATO
• BerkMin

This page was built for publication: Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers