default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th LOPSTR / 4. META 1994: Pisa, Italy
- Laurent Fribourg, Franco Turini:
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
LOPSTR
- David A. Basin:
Logic Frameworks for Logic Programs. 1-16 - Nacéra 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ínský:
On the Use of Inductive Reasoning in Program Synthesis: Prejudice and Prospects. 69-87 - David R. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-11 22:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
