Confluence and Semantics of Constraint Simplification Rules

Constraints

Volumn 4, Issue 2, 1999, Pages 133-165

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

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Committed choice languages; Confluence; Constraint reasoning; Determinism; Program analysis; Semantics of programming languages

Indexed keywords

EID: 0003370039     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009842826135     Document Type: Article

References (30)

1. Abdennadher, S. (1997). Operational semantics and confluence of constraint propagation rules. In Third International Conference on Principles and Practice of Constraint Programming, CP97 LNCS, Springer.
2. Abdennadher, S. (1998). Analyse von regelbasierten Constraintlösern. PhD thesis, Computer Science Institute, LMU Munich (in German).
3. e 3.4 User Manual. ECRC Munich.
4. Abdennadher, A. & Frühwirth, T. (1998). On completion of constraint handling rules. Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP'98), LNCS 1520, Springer.
5. Abdennadher, S., Frühwirth, T., & Meuss, H. (1996). On confluence of constraint handling rules. In E. Freuder, editor, Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, CP96 LNCS 1118, Springer.
6. Aït-Kaci, H. & Podelski, A. (1994). Functions as passive constraints in LIFE. ACM Transactions on Programming Languages and Systems 16:1279-1318.
7. Codnognet, P. & Diaz, D. (1993). Boolean constraint solving using clp(FD). In Dale Miller, editor, Logic Programming - Proceedings of the 1993 International Symposium, 525-539, Vancouver, Canada, MIT Press.
8. Codish, M., Falaschi, M., Marriott, K., & Winsborough, W. (1997). A confluent semantic basis for the analysis of concurrent constraint logic programs. Journal of Logic Programming 30:53-81.
9. Clark, K. (1978). Logic and Databases 293-322, Plenum Press, New York.
10. Dershowitz, N., Okada, N., & Sivakumar, G. (1988). Confluence 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:31-44.
11. Falaschi, M. Gabbrielli, M. Marriott, K., & Palamidessi, C. (1995). Confluence in concurrent constraint programming. In V.S. Alagar and M. Nivat, editors, Proceedings of AMAST '95 LNCS 936, Springer.
12. Frühwirth, T., Herold, A., Küchenhoff, V., Le Provost, T., Lim, P., Monfroy, E., & Wallace, M. (1992). Constraint logic programming: An informal introduction. In G. Comyn, N. E. Fuchs, and M. J. Ratcliffe, editors, Logic Programming in Action. LNCS 636:3-35, Springer.
13. Frühwirth, T. (1995). Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends. LNCS 910, Springer.
14. Frühwirth, T. (1998). A Declarative Language for Constraint Systems: Theory and Practice of Constraint Handling Rules. Habilitation, Computer Science Institute, LMU Munich.
15. Haridi, S., Janson, S., & Palamidessi, C. (1992). Structural operational semantics of AKL. Future Generation Computer Systems.
16. Jaffar, J. & Lasseq, J.-L. (1987). Constraint logic programming. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages 111-119.
17. Jaffar, J. & Maher, M. J. (1994). Constraint logic programming: A survey. Journal of Logic Programming 20:503-581.
18. Kirchner, C. & Kirchner, H. (1991). Rewriting: Theory and Applications. North-Holland.
19. Maher, M. J. (1987). Logic semantics for a class of committed-choice programs. In J.-L. Lassez, editor, Proceedings of the Fourth International Conference on Logic Programming 858-876, MIT Press.
20. Marte, M. (1996). Implementation eines Konfluenz-Tests für CSR-Programme. Advanced practical thesis, Institute of Computer Science, LMU Munich.
21. Meuss, H. (1996). Konfluenz von Constraint-Handling-Rules-Programmen. Master's thesis, Institute of Computer Science, LMU Munich.
22. Marriott, K. & Odersky, M. (1995). A confluent calculus for concurrent constraint programming with guarded choice. In 1st International Conference on Principles and Practice of Constraint Programming, CP95 310-327, Springer.
23. Marriott, K. & Stuckey, P. (1998). Programming with Constraints: An Introduction. MIT Press.
24. Newman, M. H. A. (1942). On theories with a combinatorial definition of equivalence. In Annals of Math, 43:223-243.
25. Plaisted, D. A. (1993). Equational reasoning and term rewriting systems. In D. Gabbay, C. Hogger, J. A. Robinson, and J. Siekmann, editiors, Handbook of Logic in Artificial Intelligence and Logic Programming 1:273-364, Oxford University Press, Oxford.
26. Saraswat, V. A. (1993). Concurrent Constraint Programming MIT Press, Cambridge.
27. Shapiro, E. (1989). The family of concurrent logic programming languages. ACM Computing Surveys 21:413-510.
28. Smolka, G. (1991). Residuation and guarded rules for constraint logic programming. In Digital Equipment Paris Research Laboratory Research Report, France.
29. Saraswat, V. A., Rinard, & Panangaden, P. The semantic foundations of concurrent constraint programming. In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages 333-352, ACM Press.
30. van Hentenryck, P. (1991). Constraint logic programming. The Knowledge Engineering Review 6:151-194.