Logic program schemas, constraints, and semi-unication

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

Volumn 1463, Issue , 1998, Pages 69-89

  Chasseur, Eric ^a   Deville, Yves ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER CIRCUITS; FORMAL LOGIC; LOGIC PROGRAMMING;

BASIC OPERATION; LOGIC PROGRAMS; PROGRAM SYNTHESIS; REDUCTION RULES; SECOND-ORDER LOGIC;

PROGRAM DEBUGGING;

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

References (23)

1. H. Büyükyildiz and P. Flener, Generalized logic program transformation schemas, In: N.E. Fuchs (ed.), Proc. of LOPSTR’97 (this volume)
2. Y. Deville and K.-K. Lau, Logic program synthesis: A survey, Journal of Logic Programming, 19-20:321-350, May/July 1994
3. P. Flener, Logic Program Synthesis From Incomplete Information, Kluwer Academic Publishers, 1995
4. P. Flener and Y. Deville, Logic program transformation through generalization schemata, In: M. Proietti (ed.), Proc. of LOPSTR’95, Springer-Verlag, 1996
5. P. Flener, K.-K. Lau and M. Ornaghi, On Correct Program Schemas, In: N.E. Fuchs (ed.), Proc. of LOPSTR’97 (this volume)
6. N.E. Fuchs and M.P.J. Fromherz, Schema-Based Transformations of Logic Programs, In: T.P. Clement, K.-K. Lau (eds.), Proc. of LOPSTR’91, Springer-Verlag, 1992
7. M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, W.H. Freeman and Company, 1979
8. T.S. Gegg-Harrison, Learning Prolog in a Schema-Based Environment, Instructional Science, 20:173-192, 1991
9. T.S. Gegg-Harrison, Representing Logic Programm Schemata in λProlog, In: L. Sterling (ed.), Proc. of the 12th International Conference on Logic Programming, Japan, pp. 467-481, The MIT Press, 1995
10. T.S. Gegg-Harrison, Extensible Logic Program Schemata, In: J. Gallagher (ed.), Proc. of the 6th International Workshop on Logic Program Synthesis and Transformation, Stockholm, Sweden, pp. 256-274, Springer-Verlag, 1996
11. W.D. Goldfarb, The Undecidability of the second-order unification problem, Theoretical Computer Science, 13:225-230, 1981
12. J. Hannan and D. Miller, Uses Of Higher-Order Unification For Implementing Program Transformers, In: A. Kowalski, K.A. Bowen (eds.), Proc. of ICLP’88, The MIT Press, 1988
13. G. Huet, A unification algorithm for lambda calculus, Theoretical Computer Science, 1:27-57, 1975
14. G. Huet, Résolution d’Équations dans les langages d’ordre 1, 2… w, PhD thesis, Université Paris VII, 1976
15. G. Huet and B. Lang, Proving and Applying Program Transformations Expressed with Second-Order Patterns, Acta Informatica 11 (1978), 31-55
16. I. Kraan, D. Basin and A. Bundy, Middle-Out Reasoning for Logic Programm Synthesis, In: D.S. Warren (ed.), Proc. of ICLP’93, The MIT Press, 1993
17. D. Miller and G. Nadathur, A logic programming approach to manipulating formulas and programs, Proc. of the IEEE Fourth Symposium on Logic Programming, IEEE Press, 1987
18. A. Martelli and U. Montanari, An Efficient Unification Algorithm, ACM Transactions on Programming Languages and Systems, Vol. 4, № 2, April 1982, pp. 258-282
19. T. Nipkow, Higher-order critical pairs, In: Proc. 6th IEEE Symp. Logic in Computer Science, pp. 342-349, 1991
20. J. Richardson and N.E. Fuchs, Development of correct transformation schemata for Prolog programs, In: N.E. Fuchs (e.), Proc. of LOPSTR’97 (this volume).
21. Z. Somogyi, F. Henderson and T. Conway, The execution algorithm of Mercury: an efficient purely declarative logic programming language, Journal of Logic Programming, 29(1-3):17-64, October-December 1996
22. W.W. Vasconcelos and N.E. Fuchs, Enhanced Schema-Based Transformations for Logic Programs and their Opportunistic Usage in Program Analysis and Optimisation, technical report, Institut für Informatik, Universität Zurich, 1995
23. W.W. Vasconcelos and N.E. Fuchs, An Opportunistic Approach for Logic Program Analysis and Optimisation Using Enhanced Schema-Based Transformations, In: M. Proietti (ed.), Proc. of LOPSTR’95, Springer-Verlag, 1996