Transformation Systems and Nondeclarative Properties

Annalisa Bossi, Nicoletta Cocco, Sandro Etalle

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    1 Citation (Scopus)
    63 Downloads (Pure)

    Abstract

    Program transformation systems are applied both in program synthesis and in program optimization. For logic programs the ``logic'' component makes transformations very natural and easy to be studied formally. But, when we move to Prolog programs, the ``control'' component cannot be ignored. In particular we need to cope with termination properties which are essential for ensuring the reachability of solutions for a given query. We give an overview of the main proposals in the field of transformation systems for logic programs and we emphasize how they cope with those properties of logic programs which are not strictly declarative. We focus in particular on how the transformation can affect the termination of a program.
    Original languageUndefined
    Title of host publicationComputational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
    EditorsAntonis C. Kakas, Fariba Sadri, Robert A. Kowalski
    Place of PublicationBerlin
    PublisherSpringer
    Pages162-186
    Number of pages25
    ISBN (Print)3-540-43959-5
    DOIs
    Publication statusPublished - 2002

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer-Verlag
    Volume2407

    Keywords

    • EWI-1753
    • IR-38320
    • METIS-209855

    Cite this