Local consistency for extended CSPs

Theoretical Computer Science

Volumn 410, Issue 46, 2009, Pages 4769-4783

  Maher, Michael J ^a,b  

^a CSIRO   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Arc consistency; Constraint programming; Constraint satisfaction problem; Local consistency; Pairwise consistency

Indexed keywords

ARC CONSISTENCY; CONSTRAINT PROGRAMMING; CONSTRAINT SATISFACTION PROBLEM; LOCAL CONSISTENCY; PAIRWISE CONSISTENCY;

CAVITY RESONATORS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; PROBLEM ORIENTED LANGUAGES; STEELMAKING;

LARGE SCALE SYSTEMS;

EID: 70349481984     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.07.042     Document Type: Article

References (49)

1. A. Aiba, K. Sakai, Y. Sato, D.J. Hawley, R. Hasegawa, Constraint logic programming language CAL, in: Proceedings of the 2nd. International Conference on Fifth Generation Computer Systems, vol. 1, 1988, pp. 263-276
2. Beeri C., Fagin R., Maier D., and Yannakakis M. On the desirability of acyclic database schemes. Journal of the ACM 30 3 (1983) 479-513
3. Beldiceanu N., and Contejean E. Introducing global constraints in CHIP. Mathematical Computer Modelling 20 12 (1994) 97-123
4. F. Benhamou, D.A. McAllester, P. Van Hentenryck, CLP (Intervals) revisited, in: International Symposium on Logic Programming, 1994, pp. 124-138
5. F. Benhamou, J.-L. Massat, Boolean pseudo-equations in constraint logic programming, in: Proc. 10th International Conference on Logic Programming, 1993, pp. 517-531
6. Benhamou F., and Older W.J. Applying interval arithmetic to real, integer, and Boolean constraints. Journal of Logic Programming 32 1 (1997) 1-24
7. P. Berlandier, Improving domain filtering using restricted path consistency, in: Proc. IEEE International Conference on Artificial Intelligence Applications, CAIA, 1995
8. C. Bessière, J.C. Régin, Local consistency on conjunctions of constraints, in: J.C. Régin, W. Nuijtens (Eds.) Proceedings ECAI'98 Workshop on Non-binary constraints, Brighton, UK, pp. 53-59
9. Caseau Y., Josset F., and Laburthe F. CLAIRE: Combining sets, search and rules to better express algorithms. Theory and Practice of Logic Programming 2 6 (2002) 769-805
10. Choi C.W., Harvey W., Lee J.H.M., and Stuckey P.J. Finite domain bounds consistency revisited. Proc. Australian Conference on Artificial Intelligence. LNCS vol. 4304 (2006), Springer 49-58
11. Colmerauer A. Naive solving of non-linear constraints. In: Benhamou F., and Colmerauer A. (Eds). Constraint Logic Programming: Selected Research (1993), MIT Press 89-112
12. A. Colmerauer, Solving the multiplication constraint in several approximation spaces, in: Proc. ICLP, 1, 2001
13. Debruyne R., and Bessière C. Some practicable filtering techniques for the constraint satisfaction problem. IJCAI 1 (1997) 412-417
14. R. Debruyne, C. Bessière, From restricted path consistency to max-restricted path consistency, in: Proc. Principles and Practice of Constraint Programming, 1997, pp. 312-326
15. Debruyne R., and Bessière C. Domain filtering consistencies. Journal of Artificial Intelligence Research 14 (2001) 205-230
16. Dechter R. Constraint Processing (2003), Morgan Kaufmann
17. Dechter R., and van Beek P. Local and global relational consistency. Theoretical Computer Science 173 1 (1997) 283-308
18. Dechter R., Meiri I., and Pearl J. Temporal constraint networks. Artificial Intelligence 49 (1991) 61-95
19. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, The constraint logic programming language CHIP, in: Proceedings of the 2nd. International Conference on Fifth Generation Computer Systems, 1988, pp. 249-264
20. Freuder E.C. Synthesizing constraint expressions. Communications of the ACM 21 11 (1978) 958-966
21. Freuder E.C. A sufficient condition for backtrack-bounded search. Journal of the ACM 32 4 (1985) 755-761
22. E.C. Freuder, C.D. Elfe, Neighborhood inverse consistency preprocessing, in: Proc. AAAI/IAAI, vol. 1, 1996, pp. 202-208
23. Frühwirth T.W. Theory and practice of constraint handling rules. Journal of Logic Programming 37 1-3 (1998) 95-138
24. Gervet C. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1 3 (1997) 191-244
25. Granvilliers L., and Benhamou F. Algorithm 852: RealPaver: An interval solver using constraint satisfaction techniques. ACM Transactions on Mathematical Software 32 1 (2006) 138-156
26. Gyssens M. On the complexity of join dependencies. ACM TODS 11 1 (1986) 81-108
27. W. Harvey, P.J. Stuckey, Constraint representation for propagation, in: Proc. Conf. on Principles and Practice of Constraint Programming, 1998, pp. 235-249
28. Hillier F.S., and Lieberman G.J. Introduction to Operations Research (2001), McGraw-Hill
29. ILOG Inc., ILOG Solver 4.2 User's Manual, 1998
30. J. Jaffar, J-L. Lassez, Constraint logic programming, in: Proc. 14th ACM Symposium on Principles of Programming Languages, 1987, pp. 111-119
31. Jaffar J., and Maher M.J. Constraint logic programming: A survey. Journal of Logic Programming 19 & 20 (1994) 503-581
32. Jaffar J., Michaylov S., Stuckey P., and Yap R.H.C. The CLP(ℜ)language and system. ACM Transactions on Programming Languages 14 3 (1992) 339-395
33. J. Jaffar, S. Michaylov, R.H.C. Yap, A methodology for managing hard constraints in CLP systems, in: Proc. ACM-SIGPLAN Conference on Programming Language Design and Implementation, 1991, pp. 306-316
34. P. Jégou, On the consistency of general constraint-satisfaction problems, in: AAAI, 1993, pp. 114-119
35. Kanellakis P.C. Elements of relational database theory. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (1990), Elsevier 1073-1156
36. Le Provost T., and Wallace M. Generalised constraint propagation over the CLP scheme. Journal of Logic Programming 16 3 (1993) 319-360
37. Maher M.J. Adding constraints to logic-based formalisms. In: Apt K.R., Marek V., Truszczynski M., and Warren D.S. (Eds). The Logic Programming Paradigm: A 25 Years Perspective. Artificial Intelligence Series (1999), Springer-Verlag 313-331
38. M.J. Maher, Propagation completeness of reactive constraints, in: Proc. International Conference on Logic Programming, 2002, pp. 148-162
39. Maher M.J. A synthesis of constraint satisfaction and constraint solving. Proc. Conference on Principles and Practice of Constraint Programming. LNCS vol. 2833 (2003), Springer 525-538
40. Marriott K., and Stuckey P.J. Programming with Constraints : An Introduction (1998), MIT Press
41. R. Mohr, G. Masini, Good Old Discrete Relaxation, in: Proc. ECAI, 1988, pp. 651-656
42. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7 (1974) 95-132
43. W. Pang, S.D. Goodwin, Consistency in general CSPs, in: PRICAI 2000, 2000, pp. 469-479
44. Prosser P., Stergiou K., and Walsh T. Singleton consistencies. Proc. Int. Conf. on Principles and Practice of Constraint Programming. LNCS vol. 1894 (2000) 353-368
45. Sadler A., and Gervet C. Hybrid set domains to strengthen constraint propagation and reduce symmetries. Proc. CP. LNCS vol. 3258 (2004) 604-618
46. Van Hentenryck P. A gentle introduction to NUMERICA. Artificial Intelligence 103 1-2 (1998) 209-235
47. Van Roy P., Brand P., Duchier D., Haridi S., Henz M., and Schulte C. Logic programming in the context of multiparadigm programming: The Oz experience. Theory and Practice of Logic Programming 3 6 (2003) 715-763
48. Wallace M. Search in AI: Escaping from the CSP straightjacket. Proc. of European Conf. on Artificial Intelligence (2000), IOS Press 770-776
49. T. Walsh, Relational Consistencies, APES Technical Report, APES-28-2001, 2001