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.
Author(s): Jean-Marc Andreoli, Remo Pareschi (auth.), Peter Schroeder-Heister (eds.)
Series: Lecture Notes in Computer Science 475
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1991
Language: English
Pages: 366
Tags: Artificial Intelligence (incl. Robotics); Logics and Meanings of Programs
Logic programming with sequent systems....Pages 1-30
Predicates as parameters in logic programming....Pages 31-47
A survey of GCLA: A definitional approach to logic programming....Pages 49-99
Some applications of Gentzen's proof theory in automated deduction....Pages 101-156
A logic program for transforming sequent proofs to natural deduction proofs....Pages 157-178
Modal provability foundations for negation by failure....Pages 179-222
Extensions to logic programming motivated by the construction of a generic theorem prover....Pages 223-244
A decision procedure for propositional N-Prolog....Pages 245-251
A logic programming language with lambda-abstraction, function variables, and simple unification....Pages 253-281
Logic programming, functional programming, and inductive definitions....Pages 283-309
Logic programming with strong negation....Pages 311-326
Hypothetical reasoning and definitional reflection in logic programming....Pages 327-339
Non-monotonicity and conditionals in dialogue logic....Pages 341-364
