Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One

DOI10.1007/978-3-642-21581-0_22zbMath1330.68266OpenAlexW2144102767MaRDI QIDQ3007689

Morgan Deters, Ignasi Abío, Robert Nieuwenhuis, Peter J. Stuckey

Publication date: 17 June 2011

Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_22

Mathematics Subject Classification ID

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

Related Items (1)

Reformulation based MaxSat robustness

Uses Software

• MiniSat
• BerkMin
• MiniMaxSat

Cites Work

• Unnamed Item
• Some computational aspects of DISTANCE SAT
• Satisfiability-based algorithms for Boolean optimization
• Propagation via lazy clause generation
• A framework for certified Boolean branch-and-bound optimization
• BerkMin: A fast and robust SAT-solver
• Solving SAT and SAT Modulo Theories
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
• Algorithms for Weighted Boolean Optimization
• Theory and Applications of Satisfiability Testing
• A machine program for theorem-proving

This page was built for publication: Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One