Logic Program Synthesis and Transformation

6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings
1997
ISBN: 978-3-540-62718-0
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1207, 331 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1060 g

Reihe: Lecture Notes in Computer Science

This book constitutes the strictly refereed post-workshop proceedings of the Sixth International Workshop on Logic Program Synthesis and Transformation, LOPSTR'96, held on board a ship sailing from Stockholm to Helsinki, in August 1996.
The 17 revised full papers were carefully selected from a total of initially 27 submissions. The topics covered range over the areas of synthesis of programs from specifications, verification, transformation, specialization, and analysis of programs, and the use of program schemata in program development.

Zielgruppe

Research

Autoren/Hrsg.

Gallagher, John

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme

Inhaltsverzeichnis

Refining specifications to logic programs.- Symbolic verification with gap-order constraints.- Specification-based automatic verification of Prolog programs.- Logic program specialisation: How to be more specific.- Conjunctive partial deduction in practice.- Redundant argument filtering of logic programs.- Replacement can preserve termination.- A transformation tool for pure Prolog programs.- Enhancing partial deduction via unfold/fold rules.- Abstract specialization and its application to program parallelization.- Reductions of petri nets and unfolding of propositional logic programs.- Inferring argument size relationships with CLP( $$\mathcal{R}$$ ).- Typed norms for typed logic programs.- Partial deduction in the framework of structural synthesis of programs.- Extensible logic program schemata.- Specialising meta-level compositions of logic programs.- Forms of logic specifications: A preliminary study.- Synthesis of proof procedures for default reasoning.