Solving (Weighted) Partial MaxSAT through Satisfiability Testing

DOI10.1007/978-3-642-02777-2_39zbMath1247.68242OpenAlexW2118943303WikidataQ60512148 ScholiaQ60512148MaRDI QIDQ3637178

Carlos Ansótegui, Jordi Levy, Maria Luisa Bonet

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_39

Mathematics Subject Classification ID

Related Items (30)

Quantified maximum satisfiability ⋮ MaxSAT by improved instance-specific algorithm configuration ⋮ A novel algorithm for Max Sat calling MOCE to order ⋮ WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Functional synthesis via input-output separation ⋮ Boolean lexicographic optimization: algorithms \& applications ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability ⋮ Curriculum-based course timetabling with SAT and MaxSAT ⋮ Computational protein design as an optimization problem ⋮ Resizing cardinality constraints for MaxSAT ⋮ Reformulation based MaxSat robustness ⋮ Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories ⋮ Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One ⋮ On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT ⋮ Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains ⋮ Extending linear relaxation for non-square matrices and soft constraints ⋮ Understanding the power of Max-SAT resolution through up-resilience ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving ⋮ RC2: an Efficient MaxSAT Solver ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ Comments on: ``An overview of curriculum-based course timetabling ⋮ Proofs and Certificates for Max-SAT

Uses Software

• PicoSAT
• Sat4j
• MiniMaxSat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
• Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
• On Inconsistent Clause-Subsets for Max-SAT Solving
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Theory and Applications of Satisfiability Testing
• On Solving the Partial MAX-SAT Problem

This page was built for publication: Solving (Weighted) Partial MaxSAT through Satisfiability Testing