The first and second Max-SAT evaluations
From MaRDI portal
Recommendations
Cited in
(20)- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- Simple approximation algorithms for balanced MAX~2SAT
- Optimizing with minimum satisfiability
- Incomplete inference for graph problems
- Probabilistic characterization of random Max r-Sat
- An abstract view on optimizations in SAT and ASP
- A taxonomy of exact methods for partial Max-SAT
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- New local search methods for partial MaxSAT
- A Max-SAT Inference-Based Pre-processing for Max-Clique
- 2006 and 2007 Max-SAT evaluations: contributed instances
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Generalizing Core-Guided Max-SAT
- Algorithms for Weighted Boolean Optimization
- Reformulation based MaxSat robustness
- Efficient Learning of Interpretable Classification Rules
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study
- Resolution-based lower bounds in MaxSAT
- An abstract view on optimizations in propositional frameworks
This page was built for publication: The first and second Max-SAT evaluations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604010)
