On the incremental adaptation of chr derivations

Applied Artificial Intelligence

Volumn 14, Issue 4, 2000, Pages 389-416

  Wolf, Armin ^a   Gruenhagen, Thomas ^a   Geske, Ulrich ^a  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HIGH LEVEL LANGUAGES; SEMANTICS;

CONSTRAINT SOLVING;

PROBLEM SOLVING;

EID: 0034175304     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/088395100117052     Document Type: Article

References (38)

1. Abdennadher, S. 1997. Operational semantics and confluence of constraint handling rules. In Proceedings of the Third International Conference on Principles and Practice of Constraint Programming-CP97. Lecture Notes in Computer Science 1330. New York: Springer-Verlag.
2. Abdennadher, S., T. Fruhwirth, and H. Meuss. 1999. Confluence and semantics of constraint simplification rules. Constraints, 4(2): 133-165. ISSN 1383-7133.
3. Abdennadher, S., T. Fruhwirth, and H. Meuss. 1996. On confluence of constraint handling rules. In Proceedings of the Second International Conference on Principles and Practice of Constraint Programming-CP96, ed. E. C. Freuder. Lecture Notes in Computer Science 1118:1-15. New York: Springer-Verlag.
4. Aho, A. V., J. E. Hopcroft, and J. D. Ullman. 1974. Data structures for set manipulation problems. In The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley.
5. Ait-Kaci, H. 1991. Warren’s Abstract Machine: A Tutorial Reconstruction. Cambridge, MA: MIT Press.
6. Albert, L., R. Casas, and F. Fages. 1993. Average-case analysis of unification algorithms. Theoretical Computer Science 113(1): 3-34.
7. Burg, J., S.-D. Lang, and C. E. Hughes. 1994. Finding conflict sets and back-track points in CLP (R). In Proceedings of the 11th International Conference on Logic Programming-ICLP’94, 323-338. Cambridge, MA, MIT Press.
8. Codognet, P., D. Diaz, and F. Rossi. 1996. Constraint retraction in FD. In Proceedings of the 16th Conference on the Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science 1180. New York: Springer-Verlag.
9. Colmerauer, A. 1984. Equations and inequations on finite and infinite trees. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS-84), 85-99, Tokyo, Japan. Institute for New Generation Computer Technology (ICOT).
10. Courcelle, B. 1983. Fundamental properties of infinite trees. Theoretical Computer Science 25(2): 95-169.
11. Fages, F., J. Fowler, and T. Sola. 1995. A reactive constraint logic programming scheme. In Proceedings of the Twelfth International Conference on Logic Programming. Cambridge, MA: MIT Press.
12. Fages, F., J. Fowler, and T. Sola. 1998. Experiments in reactive constraint logic programming. The Journal of Logic Programming 37: 185-212.
13. Fordan, A., and R. Yap. 1998a. Early projection in CLP (R). In Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, CP’98. Lecture Notes in Computer Science 1520, 177-191. New York: Springer-Verlag.
14. Fordan, A., and R. Yap. 1998b. Towards early projection in CLP (R). In Proceedings of the JICSLP Conference, Poster-Session. Cambridge, MA: MIT Press.
15. Fruhwirth, T. 1995. Constraint handling rules. In Constraint Programming: Basics and Trends, ed. A. Podelski. Lecture Notes in Computer Science, 910, 90-107. New York: Springer-Verlag.
16. Fruhwirth, T. 1998. Theory and practice of constraint handling rules. The Journal of Logic Programming 37:95-138.
17. Fruhwirth, T., and S. Abdennadher. 1997. Constraint-Programmierung. Berlin: Springer-Verlag.
18. Fruhwirth, T., S. Abdennadher, and H. Meuss. 1999. Confluence and semantics of constraint handling rules. Constraints, to appear.
19. Georget, Y., P. Codognet, and F. Rossi. 1999. Constraint retraction in clp(fd): Formal framework and performance results. Constraints, 4(1): 5-42.
20. Ginsberg, M. L. 1993. Dynamic backtracking. Journal of Artificial Intelligence Research 1: 25-46.
21. Holzbaur, C., and T. Fruhwirth, 1998a. Compiling constraint handling rules. In Proceedings of the 1998 ERCIM/COMPULOG Workshop on Constraints, eds. K. Apt, P. Codognet, and E. Montray. http://www.cwi.nl/-eric/ERCIM/Workshops/Workshop3/Program/fruehwirth.ps.gz
22. Holzbaur, C., and T. Fruhwirth. 1998b. Join evaluation schemata for constraint handling rules (CHR). In Proceedings of the 13th Workshop on Logic Programming, WLP’98, eds. U. Egly and H. Tompits. Technical Report 1843-1998-10, 1-12. Vienna University of Technology. http://www.kr.tuwien.ac.at/research/wlp98
23. Holzbaur, C., F. Menezes, and P. Barahona. 1996. Defeasibility in CLP (Q) through generalized slack variables. In Proceedings of the Second International Conference on Principles and Practice of Constraint Programming-CP96, ed. E. C. Freuder. Lecture Notes in Computer Science 1118, 209-223. Cambridge, MA: Springer-Verlag.
24. Jaffar, J. 1984. Efficient unification over infinite terms. New Generation Computing, 2(3):207-219.
25. Maher, M. J. 1988. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings of the 3rd IEEE Annual Symposium on Logic in Computer Science, 348-357, Edinburgh, Scotland. IEEE, Computer Society Press.
26. Martelli, A., and U. Montanari. 1982. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258-282.
27. Menezes, F., and P. Barahona. 1995. An Incremental Hierarchical Constraint Solver, (16):291-316, MIT Press, Cambridge, MA and London, England.
28. Meyer, B. 1999. Constraint diagram reasoning. In Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming-CP99, Proceedings, 316-330, Alexandria, VA, USA. Springer-Verlag, Germany.
29. Podelski, A., and G. Smolka. 1997. Situated simplification. Theoretical Computer Science 173(1): 235-252.
30. Podelski, A., and P. van Roy. 1993. The beauty and the beast algorithm. Testing entailment and disen-tailment incrementally. In Constraint Processing-Proceedings of the International Workshop at the Congress on Computer Systems and Applied Mathematics (CSAM’93), ed. M. Meyer. DFKI Research Report, No. 93, 15-42.
31. Ramachandran, V., and P. van Hentenryck. 1993. Incremental algorithms for constraint-solving and entailment over rational trees. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 761:205-217, Springer-Verlag, Berlin, Germany.
32. Sakkout, H. E., and S. Novello. 1997. Repair through conflict detection in eclipse. Technical Report, Imperial College, London.
33. Sakkout, H. E., T. Richards, and M. G. Wallace. 1997. Unimodular probing for minimal perturbance in dynamic resource feasibility problems. In Proceedings of the Workshop on the Theory and Practice of Dynamic Constraint Satisfaction at the 3rd International Conference on Principles and Practice of Constraint Programming, John Wiley and Sons, Chichester, England. http://www-icparc.doc.ic.ac.uk/-hhe/papers.html
34. Verfaillie, G., and T. Schiex. 1994 Dynamic backtracking for dynamic constraint satisfaction problems. In ECAI’94 Workshop on Constraint Satisfaction Issues Raised by Practical Applications, Amsterdam, The Netherlands.
35. Wolf, A. 1997. Incremental adaptation of constraint handling rule derivations. In Proceedings of the Workshop on the Theory and Practice of Dynamic Constraint Satisfaction at the 3rd International Conference on Principles and Practice of Constraint Programming, Schloss Hagenberg, Linz, Austria. http://www-icparc.doc.ic.ac.uk/-hhe/papers.html
36. Wolf, A. 1998a. Adaptive entailment of equations over rational trees. In Proceedings of the 13th Workshop on Logic Programming, WLP’98, eds. U. Egly and H. Tompits. Technical Report, # 1843 1998-10, 25-33. Vienna University of Technology. http://www.kr.tuwien.ac.at/research/wlp98
37. Wolf, A. 1998b. Adaptive solving of equations over rational trees. In Proceedings of the Fourth International Conference on Principles and Practice on Constraint Programming, CP’98, Poster Session. Lecture Notes in Computer Science 1520,475. New York: Springer.
38. Wolf, A. 1999. Adaptive Constraintverarbeitung mit Constraint-Handling-Rules-Ein allgemeiner Ansatz zur Losung dynamischer Constraint-Probleme. Dissertation, Technische Universität Berlin.