Local and global relational consistency

Theoretical Computer Science

Volumn 173, Issue 1, 1997, Pages 283-308

  Dechter, Rina ^a   Van Beek, Peter ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; RELATIONAL DATABASE SYSTEMS; THEOREM PROVING;

CONSTRAINT NETWORKS; GLOBAL RELATIONAL CONSISTENCY; LOCAL RELATIONAL CONSISTENCY;

CONSTRAINT THEORY;

EID: 0031077510     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)86737-0     Document Type: Article

References (39)

1. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, BIT 25 (1985) 2-23.
2. S. Arnborg, D.G. Corneil and A. Proskurowski, Complexity of finding an embedding in k-trees, SIAM J. Algebraic Discrete Methods 8 (1987) 177-184.
3. S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math. 23 (1989) 11-24.
4. C. Been, R. Fagin, D. Maier and M. Yannakakis, On the desirability of acyclic database schemes, J. ACM 30 (1983) 479-513.
5. U. Bertele and F. Brioschi, Nonserial Dynamic Programming (Academic Press, New York, 1972).
6. M.C. Cooper, An optimal k-consistency algorithm, Artif. Intell. 41 (1989) 89-95.
7. M.C. Cooper, D.A. Cohen and P.G. Jeavons, Characterizing tractable constraints, Artif. Intell. 65 (1994) 347-361.
8. M. Davis and H. Putnam, A computing procedure for quantification theory, J. ACM 7 (1960) 201-215.
9. R. Dechter, Enhancement schemes for constraint processing incorporating, backjumping, learning and cutset decomposition, Artif. Intell. 41 (1990) 273-312.
10. R. Dechter, From local to global consistency, Artif. Intell. 55 (1992) 87-107.
11. R. Dechter, Bucket elimination: a unifying framework for probabilistic inference, in: Proc. Uncertainty in Artificial Intelligence, UAI-96, (1996).
12. R. Dechter, Topological properties of time-space tradeoff, in: Proc. Uncertainty in Artificial Intelligence, UAI-96, 1996.
13. R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artif. Intell. 49 (1991) 61-95.
14. R. Dechter and J. Pearl, Network-based heuristics for constraint satisfaction problems, Artif. Intell. 34 (1988) 1-38.
15. R. Dechter and J. Pearl, Tree clustering for constraint networks, Artif. Intell. 38 (1989) 353-366.
16. R. Dechter and J. Pearl, Directed constraint networks: a relational framework for causal modeling, in: Proc. 12th Internat Joint Conf. on AI (1991) 1164-1170.
17. R. Dechter and I. Rish, Directional resolution: the Davis-Putnam procedure, revisited, in: Proc. 4th Internat Conf. on Principles of KR&R (1994) 134-145.
18. E.C. Freuder, Synthesizing constraint expressions, Comm. ACM 21 (1978) 958-966.
19. E.C. Freuder, A sufficient condition for backtrack-free search, J. ACM 29 (1982) 24-32.
20. M.L. Ginsberg, M. Frank, M.P. Halpin and M.C. Torrance, Search lessons learned from crossword puzzles, in: Proc. 8th National Conf. on AI (1990) 210-215.
21. D.Q. Goldin and P.C. Kanellakis, Constraint query algebras, in: Constraints 1 (1996) 1-41.
22. D.S. Hochbaum and J. Naor, Simple and fast algorithms for linear integer programs with two variables per inequality, SIAM J. Comput. 23(6) (1994) 1179-1192.
23. P. Jégou, On the consistency of general constraint satisfaction problems, in: Proc. 11th National Conf. on AI (1993) 114-119.
24. P. Kanellakis, in: J. van Leeuwen, ed., Elements of Relational Database Theory, Handbook of Theoretical Computer Science, Vol. B (North-Holland, Amsterdam, 1990) Ch. 7.
25. P.C. Kanellakis, G.M. Kuper and P.Z. Revesz, Constraint query languages, Proc. 9th ACM PODS (1990) 299-313.
26. L.M. Kirousis, Fast parallel constraint satisfaction, Artif. Intell. 64 (1993) 147-160.
27. J.C. Lagarias, The computational complexity of simultaneous diophantine approximation problems, SIAM J. Comput. 14(1) (1985) 196-209.
28. J.-L. Lassez and M. Mahler, On Fourier's algorithm for linear constraints, J. Autom. Reasoning 9, (1992).
29. A.K. Mackworth, Consistency in networks of relations, Artif. Intell. 8 (1977) 99-118.
30. A.K. Mackworth, On reading sketch maps, in: Proc Internat. Joint Conf. on Artificial Intelligence(IJCAI-77), Cambridge, MA (1977) 587-606.
31. A.K. Mackworth and E.C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artif. Intell. 25 (1985) 65-74.
32. D. Maier, The Theory of Relational Databases (Computer Science Press, Rockville, MD, 1983).
33. U. Montanari, Networks of constraints: fundamental properties and applications to picture processing, Inform. Sci. 7 (1974) 95-132.
34. J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 1 (Computer Science Press, Rockville, MD, 1988).
35. P. van Beek, On the minimality and decomposability of constraint networks, in: Proc. 10th National Conf. on AI (1992) 447-452.
36. P. van Beek, On the inherent level of local consistency in constraint networks, in: Proc. 12th National Conf on AI (1994) 368-373.
37. P. van Beek and R. Dechter, Constraint tightness versus global consistency, in: Proc. 4th Internat. Conf. on Principles of KR&R (1994) 572-582.
38. P. van Beek and R. Dechter, On the minimality and global consistency of row-convex constraint networks, J. ACM 42 (1995) 543-561.
39. P. Van Hentenryck, Y. Deville and C.-M. Teng, A generic arc consistency algorithm and its specializations, Artif. Intell. 57 (1992) 291-321.