Generalizing Core-Guided Max-SAT
From MaRDI portal
Recommendations
Cites work
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Consistent subsets of inconsistent systems: structure and behaviour
- Debugging design errors by using unsatisfiable cores
- On Solving the Partial MAX-SAT Problem
- Searching for Autarkies to Trim Unsatisfiable Clause Sets
- The first and second Max-SAT evaluations
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
Cited in
(16)- Guiding high-performance SAT solvers with unsat-core predictions
- Unifying reasoning and core-guided search for maximum satisfiability
- Core-boosted linear search for incomplete MaxSAT
- Iterative and core-guided maxsat solving: a survey and assessment
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Fast, flexible MUS enumeration
- Query-guided maximum satisfiability
- Improvements to core-guided binary search for MaxSAT
- On improving MUS extraction algorithms
- Cores in core based MaxSat algorithms: an analysis
- A new approach to partial MUS enumeration
- Debugging design errors by using unsatisfiable cores
- A comparative analysis and improvement of MaxSAT encodings for coalition structure generation under MC-nets
- Progression in maximum satisfiability
- Quantified maximum satisfiability: a core-guided approach
- Explainability results for the rotating workforce scheduling problem
This page was built for publication: Generalizing Core-Guided Max-SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637181)