On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes

DOI10.1007/s10472-016-9502-1zbMath1401.68283OpenAlexW2309880324WikidataQ62043237 ScholiaQ62043237MaRDI QIDQ505972

Ramón Béjar, Cèsar Fernández, Josep Argelich, Jordi Planes, Carles Mateu

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

zbMATH Keywords

phase transitionssatisfiabilityMaxSAT2SATMinSAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Open-WBO

Cites Work

• SAT-based MaxSAT algorithms
• Boolean lexicographic optimization: algorithms \& applications
• Solving satisfiability problems with preferences
• Resolution-based lower bounds in MaxSAT
• A threshold for unsatisfiability
• Optimizing with minimum satisfiability
• Iterative and core-guided maxsat solving: a survey and assessment
• A study of complexity transitions on the asymmetric traveling salesman problem
• Open-WBO: A Modular MaxSAT Solver,
• Connections in Networks: Hardness of Feasibility Versus Optimality
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
• Unnamed Item
• Unnamed Item
• Unnamed Item