SAT-based MaxSAT algorithms
From MaRDI portal
Publication:360042
DOI10.1016/J.ARTINT.2013.01.002zbMATH Open1270.68265OpenAlexW2071319337WikidataQ60512091 ScholiaQ60512091MaRDI QIDQ360042FDOQ360042
Authors: Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy 
Publication date: 23 August 2013
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S000437021300012X
Recommendations
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Exploiting resolution-based representations for MaxSAT solving
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)
Cited In (45)
- RC2: an efficient MaxSAT solver
- Solving #SAT and MAXSAT by Dynamic Programming
- Clause redundancy and preprocessing in maximum satisfiability
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Title not available (Why is that?)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- Using merging variables-based local search to solve special variants of MaxSAT problem
- MaxSAT-based scheduling of B2B meetings
- Quantified maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT
- A Preprocessor for Max-SAT Solvers
- Advances in WASP
- Hybrid metabolic network completion
- Popularity-similarity random SAT formulas
- Propositional proof systems based on maximum satisfiability
- Propositional SAT solving
- Minimal sets on propositional formulae. Problems and reductions
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- 2006 and 2007 Max-SAT evaluations: contributed instances
- A novel algorithm for Max Sat calling MOCE to order
- SAT-based preprocessing for MaxSAT
- Solving MaxSAT with bit-vector optimization
- On the complexity of inconsistency measurement
- New local search methods for partial MaxSAT
- Probabilistic characterization of random Max \(r\)-Sat
- A memetic algorithm for restoring feasibility in scheduling with limited makespan
- Iterative and core-guided maxsat solving: a survey and assessment
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Query-guided maximum satisfiability
- STACS 2004
- Understanding the complexity of axiom pinpointing in lightweight description logics
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Exploiting resolution-based representations for MaxSAT solving
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Proofs and Certificates for Max-SAT
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Using the method of conditional expectations to supply an improved starting point for CCLS
- Exploiting subproblem optimization in SAT-based maxsat algorithms
This page was built for publication: SAT-based MaxSAT algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360042)
