Toward a first-order extension of Prolog's unification using CHR: A CHR first-order constraint solver over finite or infinite trees

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2007, Pages 58-64

  Djelloul, Khalil ^a   Dao, Thi Bich Hanh ^b   Fruehwirth, Thom ^a  

^a UNIVERSITY OF ULM   (Germany)

^b Laboratoire d'Informatique Fondamentale d'Orleans   (France)

Author keywords

CHR (Constraint Handling Rules); First order constraints solving; Prolog; Theory of finite or infinite trees; Unification

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DECISION TREES; LOGIC PROGRAMMING; PATTERN RECOGNITION;

CONSTRAINT HANDLING RULES (CHR); FIRST-ORDER CONSTRAINTS SOLVING; INFINITE TREES; UNIFICATION;

UNIFIED MODELING LANGUAGE;

EID: 35248847385     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244016     Document Type: Conference Paper

References (20)

1. Abdennadher, S. 1997. Operational Semantics and Confluence of Constraint Propagation Rules. In Proc of the third International Conference on Principles and Practice of Constraint Programming. LNCS 1330.
2. Benhamou, F., Colmerauer, A., Garetta, H., Pasero, R. and Van-caneghem, M. 1996. Le manuel de Prolog IV. PrologIA, Marseille, France.
3. Colmerauer, A. 1982. Prolog and infinite trees. In K.L. Clark and S-A. Tarnlund, editors, Logic Programming. Academic Press, pp. 231-251.
4. Colmerauer, A., Kanoui, H. and Van-caneghem,M. 1983. Prolog, Theoretical Basis and Current Developments. TSI 2(4):271-311.
5. Colmerauer, A. 1984. Equations and inequations on finite and infinite trees. Proceeding of the International conference on the fifth generation of computer systems, pp. 85-99.
6. Colmerauer, A. 1990. An introduction to Prolog III. Communication of the ACM, 33(7):68-90.
7. Colmerauer, A. and Dao, T. 2003. Expressiveness of full first-order formulas in the algebra of finite or infinite trees, Constraints, 8(3): 283-302.
8. Dao, T. 2000. Resolution de contraintes du premier ordre dans la theorie des arbres finis ou infinis. These d'informatique, Universite de la mediterranee, France.
9. Djelloul, K. 2006. Decomposable theories. Journal of Theory and practice of logic programming TPLP. (to appear)
10. Duck, G., Stuckey, P., Banda, M. and Holzbaur, C. 2004. The Refined Operational Semantics of Constraint Handling Rules. In Proc of the 20th International Conference on Logic Programming. LNCS 3132, pp. 105-119.
11. Fruehwirth, T. 1998. Theory and Practice of Constraint Handling Rules. Special Issue on Constraint Logic Programming. Journal of Logic Programming. 37(1-3): 95-138.
12. Fruehwirth, T. and Abdennadher, S. 2003. Essentials of Constraint Programming. Springer.
13. Fruehwirth, T. 2005. Parallelizing Union-Find in Constraint Handling Rules Using Confluence. In proc of the 21st International Conference of Logic Programming. LNCS, Vol 3668. pp: 113-127.
14. Maher M. Complete axiomatization of the algebra of finite, rational and infinite trees. Technical report, IBM, 1988.
15. Meister, M. and Fruehwirth, T. 2006. Complexity of the CHR Rational Tree Equation Solver. In Proc of the third Workshop on Constraint Handling Rules.
16. Robinson, J.A. 1965. A machine-oriented logic based on the resolution principle. JACM, 12(1):23-41.
17. Roussel, F. 1975. Prolog : Manuel de Reference et d'Utilisation, Groupe d'Intelligence Artificielle, Marseille-Luminy.
18. Van Weert, P., Sneyers, J., Schrijvers, T. and Demoen, B. 2006. Constraint Handling Rules with Negations as Absence. In Proc of the third Workshop on Constraint Handling Rules.
19. Schrijvers, T., Demoen, B., Duck, G., Stuckey, P. and Fruehwirth, T. 2006. Automatic implication checking for CHR constraints. In Proc of the 6th International Workshop on Rule-Based Programming. ENTC, vol 147, pp. 93-111.
20. Schrijvers, T. and Fruehwirth. CHR Website, www.cs.kuleuven.ac.be/dtai/ projects/CHR/