On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Extracting MUCs from Constraint Networks
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Diagnosing and solving over-determined constraint satisfaction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
MUST: provide a finer-grained explanation of unsatisfiability
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
cmMUS: a tool for circumscription-based MUS membership testing
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
On improving MUS extraction algorithms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Accelerating MUS extraction with recursive model rotation
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Deriving minimal conflict sets by CS-trees with mark set indiagnosis from first principles
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
This paper is about transforming constraint networks to accommodate additional constraints in specific ways. The focus is on two intertwined issues. First, we investigate how partial solutions to an initial network can be preserved from the potential impact of additional constraints. Second, we study how more permissive constraints, which are intended to enlarge the set of solutions, can be accommodated in a constraint network. These two problems are studied in the general case and the light is shed on their relationship. A case study is then investigated where a more permissive additional constraint is taken into account through a form of network relaxation, while some previous partial solutions are preserved at the same time.