The first and second Max-SAT evaluations
From MaRDI portal
Publication:3604010
zbMATH Open1159.68561MaRDI QIDQ3604010FDOQ3604010
Chu-Min Li, Josep Argelich, Jordi Planes, Felip Manya
Publication date: 24 February 2009
Recommendations
Cited In (20)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- Resolution-based lower bounds in MaxSAT
- Efficient Learning of Interpretable Classification Rules
- A taxonomy of exact methods for partial Max-SAT
- Optimizing with minimum satisfiability
- Simple approximation algorithms for balanced MAX~2SAT
- A Max-SAT Inference-Based Pre-processing for Max-Clique
- 2006 and 2007 Max-SAT evaluations: contributed instances
- Title not available (Why is that?)
- New local search methods for partial MaxSAT
- Probabilistic characterization of random Max \(r\)-Sat
- An abstract view on optimizations in SAT and ASP
- Reformulation based MaxSat robustness
- Incomplete inference for graph problems
- An abstract view on optimizations in propositional frameworks
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Algorithms for Weighted Boolean Optimization
- Generalizing Core-Guided Max-SAT
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
Uses Software
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)