bokomslag Extensions of Logic Programming
Data & IT

Extensions of Logic Programming

Peter Schroeder-Heister

Pocket

769:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-16 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

Andra format:

  • 366 sidor
  • 1991
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 Tbingen 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.
  • Författare: Peter Schroeder-Heister
  • Format: Pocket/Paperback
  • ISBN: 9783540535904
  • Språk: Engelska
  • Antal sidor: 366
  • Utgivningsdatum: 1991-02-01
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K