Solving (Weighted) Partial MaxSAT through Satisfiability Testing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
- New inference rules for Max-SAT
- On Inconsistent Clause-Subsets for Max-SAT Solving
- On Solving the Partial MAX-SAT Problem
- The first and second Max-SAT evaluations
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
Cited in
(51)- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Modeling and solving staff scheduling with partial weighted maxSAT
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Understanding the power of Max-SAT resolution through up-resilience
- Using the method of conditional expectations to supply an improved starting point for CCLS
- A novel algorithm for Max Sat calling MOCE to order
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- On preprocessing for weighted MaxSAT
- Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains
- Iterative and core-guided maxsat solving: a survey and assessment
- A logical approach to efficient Max-SAT solving
- A taxonomy of exact methods for partial Max-SAT
- Computational protein design as an optimization problem
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Quantified maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- QMaxSAT: A partial Max-SAT solver
- LMHS: a SAT-IP hybrid MaxSat solver
- Reducing chaos in SAT-like search: finding solutions close to a given one
- New local search methods for partial MaxSAT
- SAT-based MaxSAT algorithms
- Minimaxsat: an efficient weighted Max-SAT solver
- Boolean lexicographic optimization: algorithms \& applications
- MaxSAT-based encodings for Group MaxSAT
- Curriculum-based course timetabling with SAT and MaxSAT
- Reformulation based MaxSat robustness
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Polarity and variable selection heuristics for SAT-based anytime MaxSAT
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- MiFuMax -- a literate MaxSAT solver. System description
- RC2: an efficient MaxSAT solver
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Resizing cardinality constraints for MaxSAT
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- A modular approach to MaxSAT modulo theories
- On Solving the Partial MAX-SAT Problem
- Proofs and Certificates for Max-SAT
- Comments on: ``An overview of curriculum-based course timetabling
- Functional synthesis via input-output separation
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- Enhancing MaxSAT local search via a unified soft clause weighting scheme
- Improving local search for weighted partial MaxSAT by initializing with historical information
- Solving weighted maximum satisfiability with branch and bound and clause learning
- Extending linear relaxation for non-square matrices and soft constraints
- An efficient solver for weighted Max-SAT
This page was built for publication: Solving (Weighted) Partial MaxSAT through Satisfiability Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637178)
