On Solving the Partial MAX-SAT Problem
From MaRDI portal
Publication:5756559
DOI10.1007/11814948_25zbMath1187.68540OpenAlexW1531103278MaRDI QIDQ5756559
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11814948_25
Related Items
Quantified maximum satisfiability ⋮ MaxSAT by improved instance-specific algorithm configuration ⋮ On an MCS-based inconsistency measure ⋮ Exploiting Resolution-Based Representations for MaxSAT Solving ⋮ A New Approach to Partial MUS Enumeration ⋮ New local search methods for partial MaxSAT ⋮ Formal methods for reasoning and uncertainty reduction in evidential grid maps ⋮ SAT-based optimal classification trees for non-binary data ⋮ Modelling Max-CSP as Partial Max-SAT ⋮ A Preprocessor for Max-SAT Solvers ⋮ Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Boolean lexicographic optimization: algorithms \& applications ⋮ Incomplete inference for graph problems ⋮ 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 ⋮ \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems ⋮ Resizing cardinality constraints for MaxSAT ⋮ Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ Paracoherent answer set computation ⋮ Propositional proof systems based on maximum satisfiability ⋮ Mining top-\(k\) motifs with a SAT-based framework ⋮ Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT ⋮ An abstract view on optimizations in SAT and ASP ⋮ Solving (Weighted) Partial MaxSAT through Satisfiability Testing ⋮ Generalizing Core-Guided Max-SAT ⋮ Algorithms for Weighted Boolean Optimization ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving ⋮ MiFuMax—a Literate MaxSAT Solver ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver ⋮ RC2: an Efficient MaxSAT Solver ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ Proofs and Certificates for Max-SAT
Uses Software
This page was built for publication: On Solving the Partial MAX-SAT Problem
