11. ICLP 1994, Workshop W10:
Proof-Theoretical Extensions on Logic Programming
Organizers
Contacts
Alberto Momigliano
CMU, Pittsburgh, PA 15213-3890, U.S.A.
mobile@lcl.cmu.edu
The workshop will provide a forum to discuss the use of proof-theoretical
techniques in logic programming as well as the influence of proof theory
on the future development of this field. Topics include proof-theoretical
foundations of logic programming, languages based on proof theory and
applications. Critical and comparative papers are also welcome.
Proof Search
- Roy Dyckhoff,
N. Shankar:
Proof Search (Tutorial).
- Roy Dyckhoff,
Luis Pinto:
Uniform Proofs and Natural Deduction.
- N. Shankar:
Using Proof Theory to Optimize Proof Search.
- Didier Galmiche:
Canonical Proofs for Linear Logic Programming Frameworks.
Partial Inductive Definitions
- Lars Hallnäs,
Per Kreuger:
Partial Inductive Definitions (Tutorial).
- Göran Falkman,
Lars Hallnäs,
Olof Torgersson:
Program Separation in GCLA.
- Per Kreuger:
A-Sufficient Substitutions in mixed Contents.
Modal Extensions
- Matteo Baldoni,
Laura Giordano,
Alberto Martelli:
A Modal Extension of Logic Programming.
Applications and Interpreters
- Iliano Cervesato:
Lollipops Taste of Vanilla too.
- Francesca Arcelli,
Ferrante Formato:
Higher-Order Implementation of Program Transformations using Algebraic
Specification.
- I. Stephan:
An SLOU Prolog Interpreter.
- Peter J. Robinson,
John Staples,
Anthony S. K. Cheng:
Theorem Proving Applications for QU-Prolog.
Other Approaches
- Jonas Barklund,
Stefania Costantini,
Pieangelo Dell'Acqua,
Gaetano Aurelio Lanzarone:
Integrating Reflection into SLD-Resolution.
- Henning Christiansen:
On Proof Predicates in Logic Programming.
- R. S. Kemp,
Graem A. Ringwood:
Reynold and Heyling Models of Logic Programs.
Copyright © Wed Jun 4 18:41:18 2008
by Michael Ley (ley@uni-trier.de)
