Logic Program Synthesis and Transformation 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Gallagher, John (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
• Έκδοση: 1st ed. 1997.
• Σειρά: Lecture Notes in Computer Science, 1207
• Θέματα: Computers.; Programming languages (Electronic computers).; Computer programming.; Artificial intelligence.; Mathematical logic.; Computer logic.; Theory of Computation.; Programming Languages, Compilers, Interpreters.; Programming Techniques.; Artificial Intelligence.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.

 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. 

 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.