Extensions of Logic Programming

1. Front Matter

   PDF

2. Logic programming with sequent systems

   • Jean-Marc Andreoli, Remo Pareschi

   Pages 1-30

3. Predicates as parameters in logic programming

   • James H. Andrews

   Pages 31-47

4. A survey of GCLA: A definitional approach to logic programming

   • Martin Aronsson, Lars-Henrik Eriksson, Lars Hallnäs, Per Kreuger

   Pages 49-99

5. Some applications of Gentzen's proof theory in automated deduction

   • Michael Beeson

   Pages 101-156

6. A logic program for transforming sequent proofs to natural deduction proofs

   • Amy Felty

   Pages 157-178

7. Modal provability foundations for negation by failure

   • D. M. Gabbay

   Pages 179-222

8. Extensions to logic programming motivated by the construction of a generic theorem prover

   • Elsa L. Gunter

   Pages 223-244

9. A decision procedure for propositional N-Prolog

   • Jörg Hudelmaier

   Pages 245-251

10. A logic programming language with lambda-abstraction, function variables, and simple unification

    • Dale Miller

    Pages 253-281

11. Logic programming, functional programming, and inductive definitions

    • Lawrence C. Paulson, Andrew W. Smith

    Pages 283-309

12. Logic programming with strong negation

    • David Pearce, Gerd Wagner

    Pages 311-326

13. Hypothetical reasoning and definitional reflection in logic programming

    • Peter Schroeder-Heister

    Pages 327-339

14. Non-monotonicity and conditionals in dialogue logic

    • Toine van Hoof, Jaap Hoepelman

    Pages 341-364

This volume contains finalized versions of papers presented at an international workshop on extensions of logic programming, held at the Seminar for Natural Language Systems at the University of Tübingen in December 1989. Several recent extensions of definite Horn clause programming, especially those with a proof-theoretic background, have much in common. One common thread is a new emphasis on hypothetical reasoning, which is typically inspired by Gentzen-style sequent or natural deduction systems. This is not only of theoretical significance, but also bears upon computational issues. It was one purpose of the workshop to bring some of these recent developments together. The volume covers topics such as the languages Lambda-Prolog, N-Prolog, and GCLA, the relationship between logic programming and functional programming, and the relationship between extensions of logic programming and automated theorem proving. It contains the results of the first conference concentrating on proof-theoretic approaches to logic programming.

• Automat
• Extension
• Prolog
• automated theorem proving
• logic
• programming
• proving
• theorem proving

Policies and ethics