Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures; G.2.1 [Discrete Mathematics]: Combinatorics -- permutations and combinatorics; I.2.4 [Artificial Intelligence]: Knowledge Representation Formalisms and Methods -- relation systems
General Terms: Algorithms, Theory
Additional Key Words and Phrases: Constraint-based reasoning, constraint networks, constraint satisfaction problems, local consistency, relations
Selected references
- Peter van Beek and Rina Dechter. On the minimality and global consistency of row-convex constraint networks. Journal of the ACM, 42(3):543-561, May 1995.
- Rina Dechter and Peter van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283-308, 20 February 1997.
- Eugene C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24-32, January 1982.
- Eugene C. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32(4):755-761, October 1985.