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.
| ISBN: | 9783540535904 |
| Publication date: | 12th February 1991 |
| Author: | Peter SchroederHeister |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 366 pages |
| Series: | Lecture Notes in Computer Science |
| Genres: |
Artificial intelligence Mathematical theory of computation |
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.
Extensions of Logic Programming Lecture Notes in Artificial Intelligence features in the following genres: Artificial intelligence, Mathematical theory of computation
Extensions of Logic Programming Lecture Notes in Artificial Intelligence is available in Paperback
Extensions of Logic Programming Lecture Notes in Artificial Intelligence was written by Peter SchroederHeister and published by Springer an imprint of Springer Berlin Heidelberg
Extensions of Logic Programming Lecture Notes in Artificial Intelligence has 366 pages
Yes it is part of Lecture Notes in Computer Science series