Chapter 2 Constraint satisfaction: An emerging paradigm

Foundations of Artificial Intelligence

Volumn 2, Issue C, 2006, Pages 13-27

  Freuder, Eugene C ^a   Mackworth, Alan K ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956770480     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(06)80006-4     Document Type: Chapter

References (81)

1. Barrow H.G., and Tenenbaum J.M. MSYS: A system for reasoning about scenes. SRI AICenter (1975)
2. Bitner J.R., and Reingold E.M. Backtrack programming techniques. Comm. ACM 18 (1975) 651-656
3. Sept. Bobrow D.G., and Raphael B. New programming languages for artificial intelligence research. ACM Computing Surveys 6 3 (1974) 153-174
4. Cambridge, MA, Aug. Borning A. ThingLab - an object-oriented system for building simulations using constraints. In: Reddy R. (Ed). Proceedings of the 5th International Joint Conference on Artificial Intelligence (1977), William Kaufmann. 0-86576-057-8 497-498
5. Report CS-79-746. Borning A. Thinglab: A constraint-oriented simulation laboratory (1979), Computer Science Dept., Stanford University
6. Nov. 6. Brown A. Qualitative knowledge, casual reasoning and the localization of failures. URL http://dspace.mit.edu/handle/1721.1/6921. Technical Report AITR-362 (1976), MIT Artificial Intelligence Laboratory, CA
7. Brown C.A., and Purdom Jr. P.W. An average time analysis of backtracking. SIAM J. Comput. 10 (1981) 583-593
8. Bruynooghe M. Solving combinatorial search problems by intelligent backtracking. Information Processing Letters 12 (1981) 36-39
9. Feb. Burstall R.M. A program for solving word sum puzzles. Computer Journal 12 1 (1969) 48-51
10. Clowes M.B. On seeing things. Artificial Intelligence 2 (1971) 79-116
11. July. Cohen J. Constraint logic programming languages. URL http://www.acm.org/pubs/toc/Abstracts/0001-0782/79209.html. CACM 33 7 (1990) 52-68
12. Oct. Colmerauer A. Prolog II reference manual and theoretical model. Technical report (1982), Groupe d'Intelligence Arificielle, Univeristé d'Aix-Marseille II
13. Colmerauer A. Prolog and infinite trees. In: Clark K.L., and Tärnlund S.-A. (Eds). Logic Programming (1982), Academic Press, Luminy 231-251
14. New York, NY, USA, Apr. Colmerauer A., and Roussel P. The birth of Prolog. In: Wexelblat R.L. (Ed). Proceedings of the Conference on History of Programming Languages, volume 28(3) of ACM Sigplan Notices (1993), ACM Press. 0-89791-570-4 37-52
15. Davis M., and Putnam H. A computing procedure for quantification theory. J. ACM 7 (1960) 201-215
16. Davis M., Logemann G., and Loveland D. A machine program for theorem-proving. Comm. ACM 5 (1962) 394-397
17. Nov. 6. de Kleer J. Local methods for localizing faults in electronic circuits. URL http://dspace.mit.edu/handle/1721.1/6921. Technical Report AIM-394 (1976), MIT Artificial Intelligence Laboratory
18. Sept. 6. de Kleer J., and Sussman G.J. Propagation of constraints applied to circuit synthesis. URL http://hdl.handle.net/1721.1/5745. Technical Report AIM-485 (1978), MIT Artificial Intelligence Laboratory
19. Dechter R. Constraint Processing (2003), Morgan Kaufmann
20. Descotte Y., and Latombe J.-C. GARI: A problem solver that plans how to machine mechanical parts. International Joint Conference on Artificial Intelligence (IJCAI '81) (1981) 766-772
21. Eastman C.M. Automated space planning. Artificial Intelligence 4 1 (1973) 41-64
22. July. Elcock E.W. Absys: the first logic programming language - A retrospective and a commentary. Journal of Logic Programming 9 1 (1990) 1-17
23. Fikes R.E. REF-ARF: A system for solving problems stated as procedures. Artificial Intelligence 1 (1970) 27-120
24. Mar. Fillmore J.P., and Williamson S.G. On backtracking: A combinatorial description of the algorithm. SIAM Journal on Computing 3 1 (1974) 41-55
25. Fox M.S., Allen B.P., and Strohm G. Job-shop scheduling: An investigation in constraint-directed reasoning. AAAI82, Proceedings (1982) 155-158
26. Freuder E.C. Synthesizing constraint expressions. Comm. ACM 21 (1978) 958-966
27. Freuder E.C. A sufficient condition for backtrack-free search. J. ACM 29 (1982) 24-32
28. Freuder E.C. A sufficient condition for backtrack-bounded search. J. ACM 32 (1985) 755-761
29. Freuder E.C., and Mackworth A.K. Introduction to the special volume on constraint-based reasoning. Artificial Intelligence 58 (1992) 1-2
30. Los Angeles. Freuder E.C., and Quinn M.J. Taking advantage of stable sets of variables in constraint satisfaction problems. Proceedings of the Ninth International Joint Conference on Artificial Intelligence (1985) 1076-1078
31. U. Illinois. Gaschnig J. A constraint satisfaction method for inference making. Proc. 12th Annual Allerton Conf. on Circuit System Theory (1974) 866-874
32. Cambridge, Mass. Gaschnig J. A general backtracking algorithm that eliminates most redundant tests. Proceedings of the Fifth International Joint Conference on Artificial Intelligence (1977) 457
33. Toronto. Gaschnig J. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. Proceedings of the Second Canadian Conference on Artificial Intelligence (1978) 268-277
34. Golomb S., and Baumert L. Backtrack programming. J. ACM 12 (1965) 516-524
35. Haralick R.M., and Elliott G.L. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14 (1980) 263-313
36. Apr. Haralick R.M., and Shapiro L.G. The consistent labeling problem: Part I. IEEE Trans. Pattern Analysis and Machine Intelligence 1 2 (1979) 173-184
37. May. Haralick R.M., and Shapiro L.G. The consistent labeling problem: Part II. IEEE Trans. Pattern Analysis and Machine Intelligence 2 3 (1980) 193-203
38. URL http://dx.doi.org/10.1016/0020-0255(78)90043-9. Haralick R.M., Davis L.S., Rosenfeld A., and Milgram D.L. Reduction operations for constraint satisfaction. Inf. Sci 14 3 (1978) 199-219
39. Hayes P.J. Computation and deduction. Proc. 2nd International Symposium on Mathematical Foundations of Computer Science (1973), Czechoslovakian Academy of Sciences 105-118
40. Bedford, MA. Hewitt C. PLANNER: A language for proving theorems in robots. Proceedings of the First International Joint Conference on Artificial Intelligence (1969), Mitre Corporation 295-301
41. Huffman D.A. Impossible objects as nonsense sentences. In: Meltzer B., and Michie D. (Eds). Machine Intelligence 6 (1971), Edinburgh Univ. Press 295-323
42. München. Jaffar J., and Lassez J.-L. Constraint logic programming. Fourteenth Annual ACM Symposium on Principles of Programming Languages (POPL) (1987) 111-119
43. Jaffar J., and Maher M.J. Constraint logic programming: A survey. Journal of Logic Programming 19 20 (1994) 503-581
44. July. Jaffar J., Michaylov S., Stuckey P.J., and Yap R.H.C. The CLP(R) language and system. URL http://www.acm.org/pubs/toc/Abstracts/0164-0925/129398.html. TOPLAS 14 3 (1992) 339-395
45. Knuth D.E. Fundamental Algorithms, volume 1 of The Art of Computer Programming (1973), Addison-Wesley
46. Knuth D.E. Estimating the efficiency of backtrack programs. Mathematics of Computation 29 (1975) 121-136
47. Kowalski R.A. Predicate logic as a programming language. Proc. IFIP '74 (1974) 569-574
48. Kowalski R.A. A proof procedure using connection graphs. J. ACM 22 4 (1975) 572-595
49. Lauriere J.-L. A language and a program for stating and solving combinatorial problems. Artificial Intelligence 10 (1978) 29-127
50. Lehmer D.H. Combinatorial problems with digital computers. Proc. of the Fourth Canadian Math. Congress (1957) 160-173
51. Lucas E. Récréations Mathématiques (1891), Gauthier-Villars
52. Mackworth A.K. Interpreting pictures of polyhedral scenes. Artificial Intelligence 4 (1973) 121-137
53. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence 8 (1977) 99-118
54. Mackworth A.K. The logic of constraint satisfaction. Artificial Intelligence 58 (1992) 3-20
55. Mackworth A.K., and Freuder E.C. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25 (1985) 65-74
56. Mackworth A.K., and Freuder E.C. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25 (1985) 247
57. Mackworth A.K., and Freuder E.C. The complexity of constraint satisfaction revisited. Artificial Intelligence 59 (1993) 57-62
58. Mackworth A.K., Mulder J.A., and Havens W.S. Hierarchical arc consistency: Exploiting structured domains in constraint satisfaction problems. Computational Intelligence 1 (1985) 118-126
59. Maier D. The Theory of Relational Databases (1983), Computer Science Press, Paris
60. McGregor J.J. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inform. Sci. 19 (1979) 229-250
61. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci. 7 (1974) 95-132
62. Nilsson N.J. Problem-Solving Methods in Artificial Intelligence (1971), McGraw-Hill
63. Nudel B. Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics. Artificial Intelligence 21 (1983) 135-178
64. Purdom Jr. P.W. Tree size by partial backtracking. SIAM J. Comput. 7 (1978) 481-491
65. Purdom Jr. P.W. Search rearrangement backtracking and polynomial average time. Artificial Intelligence 21 (1983) 117-133
66. Rosenfeld A., Hummel R.A., and Zucker S.W. Scene labelling by relaxation operations. IEEE Trans. on Systems, Man, and Cybernetics SMC-6 (1976) 420-433
67. Vancouver. Seidel R. A new method for solving constraint satisfaction problems. Proceedings of the Seventh International Joint Conference on Artificial Intelligence (1981) 338-342
68. Stallman R.M., and Sussman G.J. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence 9 (1977) 135-196
69. Stefik M. Planning with constraints (MOLGEN: Part 1). Artificial Intelligence 16 (1981) 111-140
70. Stefik M.J. Planning and meta-planning (MOLGEN: Part 2). Artificial Intelligence 16 (1981) 141-169
71. July 1. Sussman G., and Winograd T. Micro-planner reference manual. URL ftp://publications.ai.mit.edu/ai-publications/0-499/AIM-203.ps;ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-203.pdf. Technical Report AIM-203 (1970), MIT Artificial Intelligence Laboratory, New York
72. Sussman G.J., and Stallman R.M. Heuristic techniques in computer-aided circuit analysis. IEEE Trans. on Circuits and Systems CAS-22 11 (1975)
73. Sussman G.J., and Steele G.L. CONSTRAINTS: a language for expressing almosthierarchical descriptions. Artificial Intelligence 14 (1980)
74. Jan. Sutherland I.E. SKETCHPAD: A man-machine graphical communications system. Technical Report 296 (1963), MIT, Lincoln Laboratory
75. Tenenbaum J.M., and Barrow H.G. Experiments in interpretation-guided segmentation. Artif. Intell 8 3 (1977) 241-274
76. Ullmann J.R. Associating parts of patterns. Information and Control 9 6 (1966) 583-601
77. Ullmann J.R., Haralick R.M., and Shapiro L.G. Computer architecture for solving consistent labelling problems. Comput. J 28 2 (1985) 105-111
78. Van Hentenryck P. Constraint Satisfaction in Logic Programming (1989), MIT Press
79. Providence, RI, USA. Walker R.L. An enumerative technique for a class of combinatorial problems. Combinatorial Analysis, Proceedings of Symposium in Applied Mathematics. Ameri. Math. Soc. Vol X (1960) 91-94
80. Waltz D. Understanding line drawings of scenes with shadows. In: Winston P.H. (Ed). The Psychology of Computer Vision (1975), McGraw-Hill 19-91
81. URL http://doi.acm.org/10.1145/364888.364967. Wilkes M.V. Constraint-type statements in programming languages. CACM 7 10 (1964) 587-588