A synthesis of constraint satisfaction and constraint solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 525-539

  Maher, Michael J ^a  

^a LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LOGIC PROGRAMMING; SEMANTICS;

COMPLEX CONSTRAINTS; CONSTRAINT PROGRAMMING LANGUAGES; CONSTRAINT PROPAGATION; CONSTRAINT SATISFACTION; CONSTRAINT SOLVING; GLOBAL CONSTRAINTS; LOCAL CONSISTENCY; SEMANTIC RELATIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248832060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_36     Document Type: Article

References (38)

1. A. Aggoun & N. Beldiceanu, Extending CHIP to Solve Complex Scheduling and Packing Problems, In Journées Francophones De Programmation Logique, Lille, France, 1992.
2. C. Beeri, R. Fagin, D. Maier, M. Yannakakis, On the Desirability of Acyclic Database Schemes, Journal of the ACM 30(3): 479-513, 1983.
3. N. Beldiceanu, Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type, SICS Technical Report T2000/01,2000.
4. N. Beldiceanu & E. Contejean, Introducing Global Constraints in CHIP, Mathematical Computer Modelling 20 (12), 97-123, 1994.
5. F. Benhamou, F. Goualard, L. Granvilliers & J.-F. Puget, Revising Hull and Box Consistency, International Conference on Logic Programming, 230-244, 1999.
6. F. Benhamou, D. A. McAllester & P. Van Hentenryck, CLP(Intervals) Revisited, International Symposium on Logic Programming, 124-138, 1994.
7. F. Benhamou & W. J. Older, Applying Interval Arithmetic to Real, Integer, and Boolean Constraints. Journal of Logic Programming 32(1): 1-24, 1997.
8. P. Berlandier, Improving Domain Filtering using Restricted Path Consistency, Proc. IEEE International Conference on Artificial Intelligence Applications (CAIA), 1995.
9. Y. Caseau, F. Josset, F. Laburthe, CLAIRE: Combining sets, search and rules to better express algorithms. Theory and Practice of Logic Programming 2(6): 769-805, 2002.
10. C. Castro, Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies, Fundamenta Informaticae 34(3): 263-293, 1998.
11. A. Colmerauer, Solving the Multiplication Constraint in Several Approximation Spaces, International Conference on Logic Programming, 1, 2001.
12. R. Debruyne, C. Bessière, Some Practicable Filtering Techniques for the Constraint Satisfaction Problem, IJCAI (1) 1997:412-417
13. R. Debruyne, C. Bessière, From Restricted Path Consistency to Max-Restricted Path Consistency, Proc. Principles and Practice of Constraint Programming, 312-326, 1997.
14. R. Dechter & P. van Beek, Local and Global Relational Consistency, Theoretical Computer Science 173(1): 283-308, 1997.
15. R. Dechter, I. Mein & J. Pearl, Temporal Constraint Networks, Artificial Intelligence, 49, 61-95, 1991.
16. M. Dincbas, P. Van Hentenryck, H. Simonis, & A. Aggoun, The Constraint Logic Programming Language CHIP, Proceedings of the 2nd. International Conference on Fifth Generation Computer Systems, 249-264, 1988.
17. E.C. Freuder, A Sufficient Condition for Backtrack-Bounded Search, Journal of the ACM 32(4): 755-761, 1985.
18. E.C. Freuder & C.D. Elfe, Neighborhood Inverse Consistency Preprocessing, Proc. AAAI/IAAI, Vol. 1, 202-208, 1996.
19. T.W. Frühwirth, Theory and Practice of Constraint Handling Rules, Journal of Logic Programming 37(1-3): 95-138, 1998.
20. C. Gervet, Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language, Constraints 1(3): 191-244, 1997.
21. M. Gyssens, On the Complexity of Join Dependencies, ACM Transactions on Database Systems 11(1): 81-108, 1986.
22. W. Harvey, P.J. Stuckey, Constraint Representation for Propagation, Proc. Conf. on Principles and Practice of Constraint Programming, 235-249, 1998.
23. F.S. Hillier & G.J. Lieberman, Introduction to Operations Research, McGraw-Hill, 2001.
24. ILOG Inc., ILOG Solver 4.2 User's Manual, 1998.
25. J. Jaffar & J-L. Lassez, Constraint Logic Programming, Proc. 14th ACM Symposium on Principles of Programming Languages, 111-119, 1987.
26. J. Jaffar & M.J. Maher, Constraint Logic Programming: A Survey, Journal of Logic Programming 19 & 20, 503-581, 1994.
27. J. Jaffar, S. Michaylov, P. Stuckey & R.H.C. Yap, The CLP(ℜ) Language and System, ACM Transactions on Programming Languages, 14(3), 339-395, 1992.
28. J. Jaffar, S. Michaylov & R.H.C. Yap, A Methodology for Managing Hard Constraints in CLP Systems, Proc. ACM-SIGPLAN Conference on Programming Language Design and Implementation, 306-316, 1991.
29. P. Jégou, On the Consistency of General Constraint-Satisfaction Problems, AAAI, 114-119, 1993.
30. P.C. Kanellakis, Elements of Relational Database Theory, in: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, Elsevier, 1073-1156, 1990.
31. M.J. Maher, Adding Constraints to Logic-based Formalisms, in: The Logic Programming Paradigm: a 25 Years Perspective, K.R. Apt, V. Marek, M. Truszczynski and D.S. Warren (Eds.), Springer-Verlag, Artificial Intelligence Series, 313-331, 1999.
32. M.J. Maher, Propagation Completeness of Reactive Constraints, Proc. International Conference on Logic Programming, 148-162, 2002.
33. K. Marriott & P.J. Stuckey, Programming with Constraints : An Introduction, MIT Press, 1998.
34. R. Mohr & G. Masini, Good Old Discrete Relaxation, Proc. ECAI, 651-656, 1988.
35. U. Montanari, Networks of Constraints: Fundamental Properties and Applications to Picture Processing, information Sciences 7, 95-132, 1974.
36. W. Pang & S.D. Goodwin, Consistency in General CSPs, PRICAI 2000, 469-479, 2000.
37. P. Van Roy, P. Brand, D. Duchier, S. Haridi, M. Henz, C. Schulte, Logic programming in the context of multiparadigm programming: the Oz experience, Theory and Practice of Logic Programming, to appear.
38. T. Walsh, Relational Consistencies, APES Technical Report, APES-28-2001, 2001.