Automated strategies for specializing constraint logic programs

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

Volumn 2042 LNCS, Issue , 2001, Pages 125-146

  Fioravanti, Fabio ^a   Pettorossi, Alberto ^b   Proietti, Maurizio ^a  

^a CNR   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; CONSTRAINT THEORY; LOGIC PROGRAMMING; COMPUTER PROGRAMMING; SYNTHESIS (CHEMICAL);

ABSTRACT INTERPRETATIONS; AUTOMATED TRANSFORMATIONS; CONSTRAINT LOGIC PROGRAMS; CONSTRAINT PROGRAMMING; CONTEXTUAL CONSTRAINTS; GENERALIZATION PROCESS; GENERALIZED CLAUSE; TRANSFORMATIONAL APPROACH;

COMPUTER CIRCUITS; APPLICATION PROGRAMS;

EID: 84879485069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45142-0_8     Document Type: Conference Paper

References (26)

1. N. Bensaou and I. Guessarian. Transforming constraint logic programs. Theoretical Computer Science, 206:81-125, 1998. 127, 136, 142
2. A. Bossi, N. Cocco, and S. Dulli. A method for specializing logic programs. ACM Transactions on Programming Languages and Systems, 12(2):253-302, April 1990. 141
3. C. Consel and S. C. Khoo. Parameterized partial evaluation. ACM Transactions on Programming Languages and Systems, 15(3):463-493, 1993. 141, 143
4. P. Cousot and R. Cousot. Abstract interpretation: A unied lattice model for static analysis of programs by construction of approximation ofxpoints. In Proceedings 4th ACM-SIGPLAN Symposium on Principles of Programming Languages (POPL '77), pages 238-252. ACM Press, 1977. 126, 130
5. D. De Schreye, R. Glück, J. Jrgensen, M. Leuschel, B. Martens, and M. H. Srensen. Conjunctive partial deduction: Foundations, control, algorithms, and experiments. Journal of Logic Programming, 41(2-3):231-277, 1999. 142
6. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243-320. Elsevier, 1990. 130, 142
7. S. Etalle and M. Gabbrielli. Transformations of CLP modules. Theoretical Com-puter Science, 166:101-146, 1996. 127, 136, 142
8. F. Fioravanti, A. Pettorossi, and M. Proietti. Rules and strategies for contextual specialization of constraint logic programs. In M. Leuschel, editor, Proceedings of the ICLP'99 Workshop on Optimization and Implementation of Declarative Pro-gramming Languages, WOID '99, Las Cruces University, New Mexico, USA, pages 1-9, December 2-3, 1999. 125, 126, 141
9. T. Frühwirth. Theory and practice of Constraint Handling Rules. Journal of Logic Programming, Special Issue on Constraint Logic Programming, pages 95- 138, October 1998. 141
10. T. J. Hickey and D. A. Smith. Towards the partial evaluation of CLP languages. In Proceedings ACM Symposium on Partial Evaluation and Semantics Based Pro-gram Manipulation, PEPM '91, New Haven, CT, USA, SIGPLAN Notices, 26, 9, pages 43-51. ACM Press, 1991. 131
11. C. Holzbaur. OFAI clp(q,r) manual, Edition 1.3.2. Technical Report TR-95-09, Austrian Research Institute for Articial Intelligence, Vienna, 1995. 137
12. J. Jaar and M. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19/20:503-581, 1994. 125, 126, 127
13. J. Jaar, M. Maher, K. Marriott, and P. Stuckey. The semantics of constraint logic programming. Journal of Logic Programming, 37:1-46, 1998. 126, 128
14. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993. 125
15. M. Leuschel. Improving homeomorphic embedding for online termination. In P. Flener, editor, Proceedings of LOPSTR'98, Manchester, UK, June 1998, Lecture Notes in Computer Science 1559, pages 199-218. Springer-Verlag, 1999. 126, 130, 142
16. M. Leuschel, B. Martens, and D. De Schreye. Controlling generalization and polyvariance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems, 20(1):208258, 1998. 126, 130, 142
17. M. Leuschel and D. De Schreye. Constrained partial deduction. In F. Bry, B. Freitag, and D. Seipel, editors, Proceedings of the 12th Workshop Logische Program-mierung (WLP'97), pages 116-126, Munich, Germany, September 1997. 126, 142
18. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11:217-242, 1991. 126, 141
19. M. J. Maher. A transformation system for deductive database modules with perfect model semantics. Theoretical Computer Science, 110:377-403, 1993. 127, 142
20. K. Marriott and P. Stuckey. The 3 R's of optimizing constraint logic programs: Renement, Removal and Reordering. In POPL'93: Proceedings ACM SIGPLAN Symposium on Principles of Programming Languages, pages 334-344, 1993. 141, 142
21. A. Pettorossi and M. Proietti. A theory of logic program specialization and generalization for dealing with input data properties. In O. Danvy, R. Glück, and P. Thiemann, editors, Proceedings of the Dagstuhl Seminar on Partial Evaluation, Lecture Notes in Computer Science 1110, pages 386-408. Springer-Verlag, 1996. 141
22. S. Prestwich. Online partial deduction of large programs. In Proceedings ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipu-lation, PEPM '93, Copenhagen, Denmark, pages 111-118. ACM Press, 1993. 131
23. G. Puebla and M. Hermenegildo. Abstract multiple specialization and its application to program parallelization. J. of Logic Programming. Special Issue on Synthe-sis, Transformation and Analysis of Logic Programs, 41(2-3):279-316, November 1999. 141, 142
24. D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12:7-51, 1993. 131
25. M. H. Srensen and R. Glück. An algorithm of generalization in positive supercompilation. In J. W. Lloyd, editor, Proceedings of the 1995 International Logic Programming Symposium (ILPS '95), pages 465-479. MIT Press, 1995. 126, 130
26. A. Wrzos-Kaminska. Partial evaluation in constraint logic programming. In Z. W. Ras and M. Michalewicz, editors, Proceedings of the 9th International Symposium on Foundations of Intelligent Systems, Zakopane, Poland, Lecture Notes in Computer Science 1079, pages 98-107. Springer-Verlag, 1996. 126, 142