On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
DOI10.1007/S10472-016-9502-1zbMATH Open1401.68283DBLPjournals/amai/ArgelichBFMP16OpenAlexW2309880324WikidataQ62043237 ScholiaQ62043237MaRDI QIDQ505972FDOQ505972
Authors: Josep Argelich, Ramon Bejar, Cesar Fernandez, Carles Mateu, Jordi Planes 
Publication date: 27 January 2017
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10459.1/63085
Recommendations
- Minimaxsat: an efficient weighted Max-SAT solver
- Optimizing with minimum satisfiability
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Solving satisfiability problems with preferences
- Iterative and core-guided maxsat solving: a survey and assessment
- SAT-based MaxSAT algorithms
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Open-WBO: a modular MaxSAT solver
- The first and second Max-SAT evaluations
- Connections in Networks: Hardness of Feasibility Versus Optimality
- New inference rules for Max-SAT
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- A study of complexity transitions on the asymmetric traveling salesman problem
- Resolution-based lower bounds in MaxSAT
- Boolean lexicographic optimization: algorithms \& applications
- Title not available (Why is that?)
- A threshold for unsatisfiability
- Optimizing with minimum satisfiability
Uses Software
This page was built for publication: On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505972)
