A CHR-based implementation of known arc-consistency

Theory and Practice of Logic Programming

Volumn 5, Issue 4-5, 2005, Pages 419-440

  Alberti, Marco ^a   Gavanelli, Marco ^a   Lamma, Evelina ^a   Mello, Paola ^b   Milano, Michela ^b  

^a UNIVERSITY OF FERRARA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Constraint handling rules; Constraints; Known arc consistency

Indexed keywords

ALGORITHMS; CONTEXT SENSITIVE GRAMMARS; HIGH LEVEL LANGUAGES; LOGIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; WORLD WIDE WEB;

CONSTRAINT HANDELING RULES; CONSTRAINTS; KNOW ARC-CONSISTENCY; PROPAGATION ALGORITHMS;

CONSTRAINT THEORY;

EID: 22944434924     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S147106840500236X     Document Type: Article

References (32)

1. BARRUFFI, R., LAMMA, E., MELLO, P. AND MILANO, M. 1999. Least commitment on variable binding in presence of incomplete knowledge. In Proceedings of the European Conference on Planning (ECP99), S. Biundo and M. Fox, Eds. Lecture Notes in Computer Science, vol. 1809. Springer, Durham, UK, 159-171.
2. CODOGNET, P. AND DIAZ, D. 1996. Compiling constraints in clp(FD). Journal of Logic Programming 27, 3 (June), 185-226.
3. CUCCHIARA, R., GAVANELLI, M., LAMMA, E., MELLO, P., MILANO, M. AND PICCARDI, M. 1999a. Constraint propagation and value acquisition: why we should do it interactively. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, T. Dean, Ed. Morgan Kaufmann, Stockholm, Sweden, 468-477.
4. CUCCHIARA, R., GAVANELLI, M., LAMMA, E., MELLO, P., MILANO, M. AND PICCARDI, M. 1999b. Extending CLP(FD) with interactive data acquisition for 3D visual object recognition. In Proceedings of the First International Conference on the Practical Application of Constraint Technologies and Logic Programming. Practical Application Company, London, 137-155.
5. CUCCHIARA, R., GAVANELLI, M., LAMMA, E., MELLO, P., MILANO, M. AND PICCARDI, M. 2001. From eager to lazy constrained data acquisition: A general framework. New Generation Computing 19, 4 (Aug), 339-367.
6. DECHTER, R. AND DECHTER, A. 1988. Belief maintenance in dynamic constraint networks. In Proceedings of the 7th National Conference on Artificial Intelligence, T. M. Smith, Reid G.; Mitchell, Ed. Morgan Kaufmann, St. Paul, MN, 37-42.
7. DENT, M. AND MERCER, R. 1994. Minimal forward checking. In Proceedings of the Sixth International Conference on Tools with Artificial Intelligence. 432-438.
8. DINCBAS, M., VAN HENTENRYCK, P., SIMONIS, H., AGGOUN, A., GRAF, T. AND BERTHIER, F. 1988. The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer System. OHMSHA Ltd. Tokyo and Springer-Verlag, Tokyo, Japan, 693-702.
9. DOVIER, A., OMODEO, E., PONTELLI, E. AND ROSSI, G. 1996. {log}: A language for programming in logic with finite sets. Journal of Logic Programming 28(1), 1-44.
10. DOVIER, A., PONTELLI, E. AND ROSSI, G. 2001. Constructive negation and constraint logic programming with sets. New Generation Computing 19, 3 (May), 209-256.
11. DOVIER, A. AND ROSSI, G. 1993. Embedding extensional finite sets in CLP. In Proceedings of the 1993 International Symposium on Logic Programming. MIT Press, British Columbia, Canada, 540-556.
12. FALTINGS, B. AND MACHO-GONZALEZ, S. 2003. Open constraint optimization. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP-2003). Lecture Notes in Computer Science. Springer, 303-317.
13. FRÜHWIRTH, T. 1998. Theory and practice of constraint handling rules. Journal of Logic Programming 37, 1-3 (Oct.), 95-138.
14. GAVANELLI, M., LAMMA, E., MELLO, P. AND MILANO, M. 2004. Dealing with incomplete knowledge on CLP(FD) variable domains. ACM Transactions on Programming Languages and Systems 27(02), March 2005.
15. GERVET, C. 1997. Propagation to reason about sets: Definition and implementation of a practical language. Constraints 1, 191-244.
16. e User Manual, Release 5.2. IC-Parc, Imperial College, London, UK.
17. ILOG 1999. ILOG-Configurator, user manual, 1.0 ed. ILOG.
18. JAFFAR, J., MAHER, M., MARRIOTT, K. AND STUCKEY, P. 1998. The semantics of constraint logic programs. Journal of Logic Programming 37(1-3), 1-46.
19. LEGEARD, B. AND LEGROS, E. 1991. Short overview of the CLPS system. In Proceedings of the 3rd Int. Symposium on Programming Language Implementation and Logic Programming, PLILP91, J. Małuszyński and M. Wirsing, Eds. Lecture Notes in Computer Science. Springer-Verlag, Passau, Germany, 431-433.
20. MACKWORTH, A. 1977. Consistency in networks of relations. Artificial Intelligence 8, 99-118.
21. MAILHARRO, D. 1998. A classification and constraint-based framework for configuration. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 12, 383-397.
22. MITTAL, S. AND FALKENHAINER, B. 1990. Dynamic constraint satisfaction problems. In Proc. of AAAI-90. Boston, MA, 25-32.
23. PUGET, J. 1992. PECOS: A high level constraint programming language. In Proceedings of the First Singapore International Conference on Intelligent Systems (SPICIS). Singapore, 137-142.
24. PUGET, J. 1994. A C++ implementation of CLP. Tech. Rep. 94-01, ILOG Headquarters.
25. SCHIEX, T., RÉGIN, J., GASPIN, C. AND VERFAILLIE, G. 1996. Lazy arc consistency. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference. AAAI Press/MIT Press, Menlo Park, 216-221.
26. SCHIEX, T. AND VERFAILLIE, G. 1993. Nogood recording for static and dynamic constraint satisfaction problems. In Proceedings of the 5th International Conference on Tools with Artificial Intelligence. IEEE Computer Society Press, Los Alamitos, CA, USA, 48-55.
27. SERGOT, M. 1983. A query-the-user facility for logic programming. In Integrated Interactive Computing Systems, P. Degano and E. Sandewall, Eds. North-Holland, 27-41.
28. SHAPIRO, E., Ed. 1987. Concurrent Prolog - Vol. I. MIT Press.
29. SHAPIRO, E. 1989. The family of concurrent logic programming languages. ACM Computing Surveys 21, 4 (Mar.), 413-510.
30. SICStus 2003. SICStus Prolog user manual, release 3.11.0. http://www.sics.se/isl/ sicstus/.
31. SMOLKA, G. 1995. The Oz programming model. In Computer Science Today, J. van Leeuwen, Ed. Lecture Notes in Computer Science, vol. 1000. Springer-Verlag, Berlin, 324-343.
32. ZWEBEN, M. AND ESKEY, M. 1989. Constraint satisfaction with delayed evaluation. In IJCAI 89. Morgan Kaufmann, Detroit, 875-880.