Corpus ID: 2716047

Core-Guided Binary Search Algorithms for Maximum Satisfiability

  title={Core-Guided Binary Search Algorithms for Maximum Satisfiability},
  author={F. Heras and Ant{\'o}nio Morgado and Joao Marques-Silva},
  • F. Heras, António Morgado, Joao Marques-Silva
  • Published in AAAI 2011
  • Computer Science
  • Several MaxSAT algorithms based on iterative SAT solving have been proposed in recent years. These algorithms are in general the most efficient for real-world applications. Existing data indicates that, among MaxSAT algorithms based on iterative SAT solving, the most efficient ones are core-guided, i.e. algorithms which guide the search by iteratively computing unsatisfiable subformulas (or cores). For weighted MaxSAT, core-guided algorithms exhibit a number of important drawbacks, including a… CONTINUE READING
    73 Citations
    Improvements to Core-Guided Binary Search for MaxSAT
    • 47
    • PDF
    Core-Boosted Linear Search for Incomplete MaxSAT
    • 12
    • PDF
    Model-Guided Approaches for MaxSAT Solving
    • 7
    Re-implementing and Extending a Hybrid SAT-IP Approach to Maximum Satisfiability
    • 6
    • PDF
    WPM3: An (in)complete algorithm for weighted partial MaxSAT
    • 17
    CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
    • 74
    • PDF
    On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
    • 5
    • PDF
    Iterative SAT Solving for Minimum Satisfiability
    • 17


    Algorithms for Maximum Satisfiability using Unsatisfiable Cores
    • 122
    • PDF
    Algorithms for Weighted Boolean Optimization
    • 149
    • PDF
    On Solving the Partial MAX-SAT Problem
    • 236
    MiniMaxSAT: An Efficient Weighted Max-SAT solver
    • 126
    • PDF
    Solving (Weighted) Partial MaxSAT through Satisfiability Testing
    • 131
    • Highly Influential
    • PDF
    Using Learnt Clauses in maxsat
    • 8
    • PDF
    Algorithms for the maximum satisfiability problem
    • 219
    Translating Pseudo-Boolean Constraints into SAT
    • 599
    • PDF