On completion of constraint handling rules

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

Volumn 1520, Issue , 1998, Pages 25-39

  Abdennadher, Slim ^a   Frühwirth, Thom ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; HIGH LEVEL LANGUAGES;

COMPLETION METHODS; CONDITIONAL TERM REWRITING SYSTEMS; CONSTRAINT HANDLING RULES; CONSTRAINT SOLVERS; SUFFICIENT AND NECESSARY CONDITION; WRITING CONSTRAINT;

LOGIC PROGRAMMING;

EID: 84957650648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_4     Document Type: Conference Paper

References (14)

1. S. Abdennadher. Operational semantics and conuence of constraint propagation rules. In Third International Conference on Principles and Practice of Constraint Programming, CP'97, LNCS 1330. Springer-Verlag, 1997.
2. S. Abdennadher. Analyse von regelbasierten Constraintlösern (in German). PhD thesis, Computer Science Institute, LMU Munich, February 1998.
3. S. Abdennadher, T. Frühwirth, and H. Meuss. On conuence of constraint handling rules. In 2nd International Conference on Principles and Practice of Constraint Programming, CP'96, LNCS 1118. Springer-Verlag, August 1996. Revised and extended version to appear in the Constraints Journal.
4. ACM. The constraint programming working group. Technical report, ACM-MIT SDRC Workshop, Report Outline, Draft, September 1996.
5. L. Bachmair and N. Dershowitz. Commutation, transformation, and termination. In J. H. Siekmann, editor, Proceedings of the Eighth International Conference on Automated Deduction (Oxford, England), LNCS 230. Springer-Verlag, July 1986.
6. M. P. Bonacina and J. Hsiang. On rewrite programs: Semantics and relationsship with PROLOG. Journal of Logic Programming, 14:155-180, 1992.
7. N. Dershowitz and N. A. Josephson. Logic programming by completion. In Sten- Åke Tärnlund, editor, Proceedings of the Second International Conference on Logic Programming, Uppsala, 1984.
8. N. Dershowitz, N. Okada, and G. Sivakumar. Conuence of conditional rewrite systems. In J.-P. Jouannaud and S. Kaplan, editors, Proceedings of the 1st International Workshop on Conditional Term Rewriting Systems, LNCS 308, 1988.
9. T. Frühwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, LNCS 910. Springer-Verlag, March 1995.
10. T. Frühwirth. A Declarative Language for Constraint Systems: Theory and Practice of Constraint Handling Rules. Habilitation, Computer Science Institute, LMU Munich, 1998. Shortened version to appear in Journal of Logic Programming, Special Issue on Constraint Logic Programming, P. Stuckey and K. Marriot, editors.
11. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 20, 1994.
12. D. E. Knuth and P. B. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra. Pergamon Press, 1970.
13. K. Marriott and P. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.
14. V. A. Saraswat. Concurrent Constraint Programming. MIT Press, Cambridge, 1993.