Some computational aspects of DISTANCE SAT

DOI10.1007/s10817-006-9063-9zbMath1113.68096OpenAlexW2062059592MaRDI QIDQ877840

Olivier Bailleux, Pierre Marquis

Publication date: 3 May 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-006-9063-9

zbMATH Keywords

propositional formula

Mathematics Subject Classification ID

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

Related Items

Implementing semantic merging operators using binary decision diagrams ⋮ Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One ⋮ The Next Whisky Bar ⋮ Minimal distance of propositional models

Uses Software

• BerkMin
• Jerusat

Cites Work

• A linear-time transformation of linear inequalities into conjunctive normal form
• A theory of diagnosis from first principles
• Reducing belief revision to circumscription (and vice versa)
• A logical approach to interpolation based on similarity relations
• BerkMin: A fast and robust SAT-solver
• Many hard examples for resolution
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Theory and Applications of Satisfiability Testing
• Decomposable negation normal form
• A machine program for theorem-proving
• Principles and Practice of Constraint Programming – CP 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item