A theory of diagnosis from first principles
Artificial Intelligence
Artificial Intelligence
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Evaluating compound critiquing recommenders: a real-user study
Proceedings of the 8th ACM conference on Electronic commerce
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A fast arc consistency algorithm for n-ary constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Generalized arc consistency for positive table constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
On finding all minimally unsatisfiable subformulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Reformulating Positive Table Constraints Using Functional Dependencies
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
We present a novel approach to automatically reformulating constraints defined as tables of allowed assignments to variables. Constraints of this form are common in a variety of settings. Specifically, we propose an approach in which a high arity table constraint is reformulated as a conjunction of lower arity constraints. The reformulation is logically equivalent to the original constraint. We demonstrate that by using functional dependencies from the field of database design such reformulations can be found. We apply the approach to the problem of generating explanations as minimal conflicts. We show that reformulations can be found that yield compact explanations of inconsistency by reducing both the number of variables required to explain inconsistency and the arity of the largest constraint involved in the explanation. We demonstrate our approach on real-world datasets with positive results.