From local to global consistency
Artificial Intelligence
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Constraints, consistency and closure
Artificial Intelligence
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
DISTANCE-SAT: complexity and algorithms
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A declarative approach to robust weighted Max-SAT
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Reformulation based MaxSAT robustness
Constraints
| Hi-index | 0.00 |
A δ-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover from unforeseen events (e.g., a resource becoming unavailable). The concept of δ-models was introduced by Ginsberg, Parkes, and Roy (1998), where it was proved that finding δ-models for general Boolean formulas is NP-complete. In this paper, we extend that result by studying the complexity of finding δ-models for classes of Boolean formulas which are known to have polynomial time satisfiability solvers. In particular, we examine 2-SAT, Horn-SAT, Affine-SAT, dual-Horn-SAT, 0-valid and 1-valid SAT. We see a wide variation in the complexity of finding δ-models, e.g., while 2-SAT and Affine-SAT have polynomial time tests for δ-models, testing whether a Horn-SAT formula has one is NP-complete.