Constraint propagation with interval labels
Artificial Intelligence
Integer and combinatorial optimization
Integer and combinatorial optimization
Tree clustering for constraint networks (research note)
Artificial Intelligence
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Artificial Intelligence - Special issue on knowledge representation
Constraint reasoning based on interval arithmetic: the tolerance propagation approach
Artificial Intelligence - Special volume on constraint-based reasoning
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Constraint arithmetic on real intervals
Constraint logic programming
Arc-consistency and arc-consistency again
Artificial Intelligence
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Acceleration methods of numeric CSPc
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the conversion between non-binary constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the complexity of integer programming
Journal of the ACM (JACM)
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Generating Semantic Descriptions From Drawings of Scenes With Shadows
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Type Parametric Compilation of Algebraic Constraints
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Developing approaches for solving a telecommunications feature subscription problem
Journal of Artificial Intelligence Research
The complexity of integer bound propagation
Journal of Artificial Intelligence Research
Finite domain bounds consistency revisited
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
| Hi-index | 0.00 |
Many problems and applications can be naturally modelled and solved using constraints with more than two variables. Such n-ary constraints, in particular, arithmetic constraints are provided by many finite domain constraint programming systems. The best known worst case time complexity of existing algorithms (GAC-schema) for enforcing arc consistency on general CSPs is O(edn) where d is the size of domain, e is the number of constraints and n is the maximum number of variables in a single constraint. We address the question of efficient consistency enforcing for n-ary constraints. An observation here is that even with a restriction of n-ary constraints to linear constraints, arc consistency enforcing is NP-complete. We identify a general class of monotonic n-ary constraints (which includes linear inequalities as a special case). Such monotonic constraints can be made arc consistent in time O(en3d). The special case of linear inequalities can be made arc consistent in time O(en2d) using bounds-consistency which exploits special properties of the projection function.