Extensions of Logic Programming

International Workshop, Tübingen, FRG, December 8-10, 1989. Proceedings
1991
ISBN: 978-3-540-53590-4
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 475, 366 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1160 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Schroeder-Heister, Peter

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme

Inhaltsverzeichnis

Logic programming with sequent systems.- Predicates as parameters in logic programming.- A survey of GCLA: A definitional approach to logic programming.- Some applications of Gentzen's proof theory in automated deduction.- A logic program for transforming sequent proofs to natural deduction proofs.- Modal provability foundations for negation by failure.- Extensions to logic programming motivated by the construction of a generic theorem prover.- A decision procedure for propositional N-Prolog.- A logic programming language with lambda-abstraction, function variables, and simple unification.- Logic programming, functional programming, and inductive definitions.- Logic programming with strong negation.- Hypothetical reasoning and definitional reflection in logic programming.- Non-monotonicity and conditionals in dialogue logic.