Skip to main content
SpringerLink
Log in

Logic Program Synthesis and Transformation

5th International Workshop, LOPSTR'95, Utrecht, The Netherlands, September 20-22, 1995. Proceedings

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Maurizio Proietti
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1048)

Included in the following conference series:

Conference proceedings info: LOPSTR 1995.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  2. Ecological partial deduction: Preserving characteristic trees without constraints

    • Michael Leuschel
    Pages 1-16

  3. Memoing evaluation by source-to-source transformation

    • Jens E. Wunderwald
    Pages 17-32

  4. Transformation of left terminating programs: The reordering problem

    • Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
    Pages 33-45

  5. Derivation of concurrent algorithms in Tempo

    • Steve Gregory
    Pages 46-60

  6. An argumentation-theoretic approach to logic program transformation

    • Francesca Toni, Robert A. Kowalski
    Pages 61-75

  7. Complexity of Horn programs

    • Erik Aarts
    Pages 76-90

  8. Studying the cost of logic languages in an abstract interpretation framework for granularity analysis

    • M. M. Gallardo, J. M. Troya
    Pages 91-105

  9. Towards automatic control for CLP(χ) programs

    • Fred Mesnard
    Pages 106-119

  10. Ideal refinement of Datalog programs

    • Giovanni Semeraro, Floriana Esposito, Donato Malerba
    Pages 120-136

  11. Guiding program development systems by a connection based proof strategy

    • Christoph Kreitz, Jens Otten, Stephan Schmitt
    Pages 137-151

  12. Towards an object-oriented methodology for deductive synthesis of logic programs

    • Kung -Kiu Lau, Mario Ornaghi
    Pages 152-169

  13. Logic program synthesis by induction over Horn Clauses

    • Andrew J. Parkes, Geraint A. Wiggins
    Pages 170-170

  14. Logic program transformation through generalization schemata [extended abstract]

    • Pierre Flener, Yves Deville
    Pages 171-173

  15. An opportunistic approach for logic program analysis and optimisation using enhanced schema-based transformations

    • Wamberto W. Vasconcelos, Norbert E. Fuchs
    Pages 174-188

  16. Solving deductive planning problems using program analysis and transformation

    • D. A. de Waal, M. Thielscher
    Pages 189-203

  17. Towards a complete proof procedure to prove properties of normal logic programs under the completion

    • Sophie Renault
    Pages 204-218

  18. Termination of logic programs using semantic unification

    • Thomas Arts, Hans Zantema
    Pages 219-233

  19. On the mechanics of metasystem hierarchies in program transformation

    • Robert Glück
    Pages 234-251

  20. Efficient translation of lazy functional logic programs into Prolog

    • Michael Hanus
    Pages 252-266
Back to top

Other volumes

  1. Logic Program Synthesis and Transformation

Keywords

About this book

This book constitutes the refereed proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation, LOPSTR'95, held in Utrecht, The Netherlands in September 1995.
The 19 papers included were selected from 40 workshop submissions; they offer a unique up-to-date account of the use of formal synthesis and transformation techniques for computer-aided development of logic programs. Among the topics addressed are deductive and inductive program synthesis, synthesis models based on constructive type theory, program specification, program analysis, theorem proving, and applications to various types of programs.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation