Some computational aspects of DISTANCE SAT

DOI10.1007/S10817-006-9063-9zbMATH Open1113.68096OpenAlexW2062059592MaRDI QIDQ877840FDOQ877840

Authors: 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

Recommendations

• Minimal distance of propositional models
• An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF
• Recent Advances in Constraints
• optsat: A Tool for Solving SAT Related Optimization Problems
• As Close as It Gets

zbMATH Keywords

propositional formula

Mathematics Subject Classification ID

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

Cites Work

• Theory and Applications of Satisfiability Testing
• BerkMin: A fast and robust SAT-solver
• Title not available (Why is that?)
• A logical approach to interpolation based on similarity relations
• Consequence finding algorithms
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Efficient CNF encoding of Boolean cardinality constraints
• A theory of diagnosis from first principles
• A machine program for theorem-proving
• Many hard examples for resolution
• A linear-time transformation of linear inequalities into conjunctive normal form
• Title not available (Why is that?)
• Decomposable negation normal form
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reducing belief revision to circumscription (and vice versa)

Cited In (8)

• Minimal distance of propositional models
• Recent Advances in Constraints
• Simplified forms of computerized reasoning with distance semantics
• Implementing semantic merging operators using binary decision diagrams
• Boosting distance-based revision using SAT encodings
• An abstract view on optimizations in propositional frameworks
• The next whisky bar
• Reducing chaos in SAT-like search: finding solutions close to a given one

Uses Software

• BerkMin
• Jerusat

This page was built for publication: Some computational aspects of DISTANCE SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877840)