Cores in core based MaxSat algorithms: an analysis
From MaRDI portal
Recommendations
Cited in
(17)- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- Core-boosted linear search for incomplete MaxSAT
- Iterative and core-guided maxsat solving: a survey and assessment
- Improvements to core-guided binary search for MaxSAT
- New local search methods for partial MaxSAT
- Volt: a lazy grounding framework for solving very large MaxSAT instances
- Generalizing Core-Guided Max-SAT
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Unsatisfiable core analysis and aggregates for optimum stable model search
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- MiFuMax -- a literate MaxSAT solver. System description
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- A comparative analysis and improvement of MaxSAT encodings for coalition structure generation under MC-nets
- Progression in maximum satisfiability
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT
- CoReS: a tool for computing core graphs via SAT/SMT solvers
This page was built for publication: Cores in core based MaxSat algorithms: an analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192051)