A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
On the complexity of join dependencies
ACM Transactions on Database Systems (TODS)
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Encodings of non-binary constraint satisfaction problems
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
A generic customizable framework for inverse local consistency
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
On forward checking for non-binary constraint satisfaction
Artificial Intelligence
Binary vs. non-binary constraints
Artificial Intelligence
Solving Non-binary CSPs Using the Hidden Variable Encoding
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Improving domain filtering using restricted path consistency
CAIA '95 Proceedings of the 11th Conference on Artificial Intelligence for Applications
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Principles of Constraint Programming
Principles of Constraint Programming
Domain filtering consistencies
Journal of Artificial Intelligence Research
Neighborhood inverse consistency preprocessing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Solving a Telecommunications Feature Subscription Configuration Problem
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Constraint-Level Advice for Shaving
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Relational consistency by constraint filtering
Proceedings of the 2010 ACM Symposium on Applied Computing
Failed value consistencies for constraint satisfaction
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Developing approaches for solving a telecommunications feature subscription problem
Journal of Artificial Intelligence Research
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Integrating strong local consistencies into constraint solvers
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Journal of Artificial Intelligence Research
A framework for decision-based consistencies
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Extending generalized arc consistency
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
Hi-index | 0.00 |
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency or weaker local consistency properties. This is in contrast with binary constraints where numerous such domain filtering consistencies have been proposed. In this paper we present a detailed theoretical, algorithmic and empirical study of domain filtering consistencies for non-binary problems. We study three domain filtering consistencies that are inspired by corresponding variable based domain filtering consistencies for binary problems. These consistencies are stronger than generalized arc consistency, but weaker than pairwise consistency, which is a strong consistency that removes tuples from constraint relations. Among other theoretical results, and contrary to expectations, we prove that these new consistencies do not reduce to the variable based definitions of their counterparts on binary constraints. We propose a number of algorithms to achieve the three consistencies. One of these algorithms has a time complexity comparable to that for generalized arc consistency despite performing more pruning. Experiments demonstrate that our new consistencies are promising as they can be more efficient than generalized arc consistency on certain non-binary problems.