Recommendations
Cited in
(55)- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
- Minimization of visibly pushdown automata using partial Max-SAT
- RC2: an efficient MaxSAT solver
- Solving #SAT and MAXSAT by Dynamic Programming
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- A taxonomy of exact methods for partial Max-SAT
- Quantified maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- scientific article; zbMATH DE number 6297727 (Why is no real title available?)
- Boolean lexicographic optimization: algorithms \& applications
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Curriculum-based course timetabling with SAT and MaxSAT
- A Preprocessor for Max-SAT Solvers
- Paracoherent answer set computation
- Propositional proof systems based on maximum satisfiability
- Investigation of maximum and minimum satisfiability problems using \(L\)-partition
- Modelling Max-CSP as Partial Max-SAT
- Comparison of SAT-based and ASP-based algorithms for inconsistency measurement
- SAT-based optimal classification trees for non-binary data
- Community-Based Partitioning for MaxSAT Solving
- Solving MaxSAT with bit-vector optimization
- Resizing cardinality constraints for MaxSAT
- A new approach to partial MUS enumeration
- New local search methods for partial MaxSAT
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- Using execution logs for improving pseudo-Boolean propagation
- Iterative and core-guided maxsat solving: a survey and assessment
- Solving sparse instances of Max SAT via width reduction and greedy restriction
- An abstract view on optimizations in SAT and ASP
- Enhancing MaxSAT local search via a unified soft clause weighting scheme
- Improving local search for weighted partial MaxSAT by initializing with historical information
- Boosting branch-and-bound MaxSAT solvers with clause learning
- QMaxSAT: A partial Max-SAT solver
- Maximum Constraint Satisfaction on Diamonds
- Certified Core-Guided MaxSAT Solving
- Exploiting resolution-based representations for MaxSAT solving
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Incomplete inference for graph problems
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- An abstract view on optimizations in propositional frameworks
- Formal methods for reasoning and uncertainty reduction in evidential grid maps
- Analysis and solving SAT and MAX-SAT problems using an L-partition approach
- Proofs and Certificates for Max-SAT
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Mining top-\(k\) motifs with a SAT-based framework
- Integrating multi-armed bandit with local search for MaxSAT
- Algorithms for Weighted Boolean Optimization
- Generalizing Core-Guided Max-SAT
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- On an MCS-based inconsistency measure
- MiFuMax -- a literate MaxSAT solver. System description
- Exploiting subproblem optimization in SAT-based maxsat algorithms
This page was built for publication: On Solving the Partial MAX-SAT Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756559)
