4. LOPSTR / 4. META 1994:
Pisa,
Italy
Laurent Fribourg, Franco Turini (Eds.):
Logic Programming Synthesis and Transformation - Meta-Programming in Logic. 4th Internation Workshops, LOPSTR'94 and META'94, Pisa, Italy, June 20-21, 1994, Proceedings.
Lecture Notes in Computer Science 883 Springer 1994, ISBN 3-540-58792-6
@proceedings{DBLP:conf/lopstr/1994,
editor = {Laurent Fribourg and
Franco Turini},
title = {Logic Programming Synthesis and Transformation - Meta-Programming
in Logic. 4th Internation Workshops, LOPSTR'94 and META'94, Pisa,
Italy, June 20-21, 1994, Proceedings},
booktitle = {LOPSTR/META},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {883},
year = {1994},
isbn = {3-540-58792-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
LOPSTR
- David A. Basin:
Logic Frameworks for Logic Programs.
1-16
- N. Bensaou, Irène Guessarian:
An Extended Transformation System for CLP Programs.
17-35
- Dmitri Boulanger, Maurice Bruynooghe:
Using Call/Exit Analysis for Logic Program Transformation.
36-50
- J. Cook, John P. Gallagher:
A Transformation System for Definite Programs Based on Termination Analysis.
51-68
- Pierre Flener, Lubos Popelínsky:
On the Use of Inductive Reasoning in Program Synthesis: Prejudice and Prospects.
69-87
- David Gilbert, Christopher J. Hogger, Jirí Zlatuska:
Transforming Specifications of Observable Behaviour into Programs.
88-103
- Kung-Kiu Lau, Mario Ornaghi:
On Specification Frameworks and Deductive Synthesis of Logic Programs.
104-121
- Michael Leuschel:
Partial Evaluation of the "Real Thing".
122-137
- Emmanuil I. Marakakis, John P. Gallagher:
Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types.
138-153
- Sophie Renault:
Generalizing Extended Execution for Normal Programs.
154-169
- Chiaki Sakama, Hirohisa Seki:
Partial Deduction of Disjunctive Logic Programs: A Declarative Approach.
170-182
- Giovanni Semeraro, Floriana Esposito, Donato Malerba, Clifford Brunk, Michael J. Pazzani:
Avoiding Non-Termination when Learning Logical Programs: A Case Study with FOIL and FOCL.
183-198
- Christine Solnon, Michel Rueher:
Propagation of Inter-argument Dependencies in "Tuple-distributive" Type Inference Systems.
199-214
- Paul Tarau, Verónica Dahl:
Logic Programming and Logic Grammars with First-Order Continuations.
215-230
- Geraint A. Wiggins:
Improving the Whelk System: A Type-Theoretic Reconstruction.
231-247
META
- Frank van Harmelen:
A Model of Costs and Benefits of Meta-Level Computation.
248-261
- Jonas Barklund, Katrin Boberg, Pierangelo Dell'Acqua:
A Basis for a Multi-Level Meta-Logic Programming Language.
262-275
- Marion Mircheva:
Logic Programs with Tests.
276-292
- Barbara Dunin-Keplicz:
An Architecture with Multiple Meta-Levels for the Development of Correct Programs.
293-310
- Annalisa Bossi, Sandro Etalle:
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics.
311-331
- Wiebe van der Hoek, John-Jules Ch. Meyer, Jan Treur:
Formal Semantics of Temporal Epistemic Reflection.
332-352
- Jan Treur:
Temporal Semantics of Meta-Level Architectures for Dynamic Control of Reasoning.
353-376
- Antonio Brogi, Simone Contiero:
Gödel as a Meta-Language for Composing Logic Programs.
377-394
- Patricia M. Hill:
A Module System for Meta-Programming.
395-409
- Giuseppe Attardi, Maria Simi:
Building Proofs in Context.
410-424
- Fausto Giunchiglia, Alessandro Cimatti:
Introspective Metatheoretic Reasoning.
425-439
- Marco Comini, Giorgio Levi, Giuliana Vitiello:
Abstract Debugging of Logic Program.
440-450
Last update Fri May 25 08:25:32 2012
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page