A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
An optimal k-consistency algorithm
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Constraint satisfaction algorithms
Computational Intelligence
From local to global consistency
Artificial Intelligence
The logic of constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Fast parallel constraint satisfaction
Artificial Intelligence
On the inherent level of local consistency in constraint networks
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Characterising tractable constraints
Artificial Intelligence
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
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
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
On the Complexity of Achieving K-Consistency
On the Complexity of Achieving K-Consistency
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
Erratum: P. van Beek and R. Dechter's theorem on constraint looseness and local consistency
Journal of the ACM (JACM)
Consistency and set intersection
Eighteenth national conference on Artificial intelligence
Modelling and Solving Employee Timetabling Problems
Annals of Mathematics and Artificial Intelligence
Discrete Applied Mathematics
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Reasoning on interval and point-based disjunctive metric constraints in temporal contexts
Journal of Artificial Intelligence Research
Set intersection and consistency in constraint networks
Journal of Artificial Intelligence Research
Consistency and set intersection
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraints, consistency and closure
Artificial Intelligence
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Avian influenza: Temporal modeling of a human to human transmission case
Expert Systems with Applications: An International Journal
Pruning by equally constrained variables
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Managing qualitative preferences with constraints
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
Hi-index | 0.01 |
Constraint networks are a simple representation and reasoning framework with diverse applications. In this paper, we identify two new complementary properties on the restrictiveness of the constraints in a network—constraint tightness and constraint looseness—and we show their usefulness for estimating the level of local consistency needed to ensure global consistency, and for estimating the level of local consistency present in a network. In particular, we present a sufficient condition, based on constraint tightness and the level of local consistency, that guarantees that a solution can be found in a backtrack-free manner. The condition can be useful in applications where a knowledge base will be queried over and over and the preprocessing costs can be amortized over many queries. We also present a sufficient condition for local consistency, based on constraint looseness, that is straightforward and inexpensive to determine. The condition can be used to estimate the level of local consistency of a network. This in turn can be used in deciding whether it would be useful to preprocess the network before a backtracking search, and in deciding which local consistency conditions, if any, still need to be enforced if we want to ensure that a solution can be found in a backtrack-free manner. Two definitions of local consistency are employed in characterizing the conditions: the traditional variable-based notion and a recently introduced definition of local consistency called relational consistency.