Implementing semantic merging operators using binary decision diagrams
International Journal of Approximate Reasoning
A Soft Constraint of Equality: Complexity and Approximability
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Solving Optimization Problems with DLL
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Reasoning about optimal collections of solutions
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Reducing chaos in SAT-like search: finding solutions close to a given one
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
OPTSAT: a tool for solving SAT related optimization problems
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Dynamic SAT with decision change costs: formalization and solutions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
In many AI fields, one must face the problem of finding a solution that is as close as possible to a given configuration. This paper addresses this problem in a propositional framework. We introduce the decision problem distance-sat, which consists in determining whether a propositional formula admits a model that disagrees with a given partial interpretation on at most d variables. The complexity of distance-sat and of several restrictions of it are identified. Two algorithms based on the well-known Davis/Logemann/Loveland search procedure for the satisfiability problem sat are presented so as to solve distance-sat for CNF formulas. Their computational behaviors are compared with the ones offered by sat solvers on sat encodings of distance-sat instances. The empirical evaluation allows us to draw firm conclusions about the respective performances of the algorithms and to relate the difficulty of distance-sat with the difficulty of sat from the practical side.