Extensions of Logic Programming: International Workshop...

Extensions of Logic Programming: International Workshop Tübingen, FRG, December 8–10, 1989 Proceedings

Jean-Marc Andreoli, Remo Pareschi (auth.), Peter Schroeder-Heister (eds.)
이 책이 얼마나 마음에 드셨습니까?
파일의 품질이 어떻습니까?
책의 품질을 평가하시려면 책을 다운로드하시기 바랍니다
다운로드된 파일들의 품질이 어떻습니까?

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.

년:
1991
판:
1
출판사:
Springer-Verlag Berlin Heidelberg
언어:
english
페이지:
366
ISBN 10:
354053590X
ISBN 13:
9783540535904
시리즈:
Lecture Notes in Computer Science 475
파일:
DJVU, 3.64 MB
IPFS:
CID , CID Blake2b
english, 1991
다운로드 (djvu, 3.64 MB)
로의 변환이 실행 중입니다
로의 변환이 실패되었습니다

주로 사용되는 용어