A tutorial on proof theoretic foundations of logic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2916, Issue , 2003, Pages 109-127

  Bruscoli, Paola ^a   Guglielmi, Alessio ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

META-THEORY; PROOF-THEORETIC NOTIONS; ABSTRACT LOGIC;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

LOGIC PROGRAMMING; PROGRAMMING THEORY;

EID: 0347526057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24599-5_9     Document Type: Conference Paper

References (8)

1. J. Gallier. Constructive logics. Part I: A tutorial on proof systems and typed λ-calculi. Theoretical Computer Science, 110:249-339, 1993.
2. G. Gentzen. Investigations into logical deduction. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68-131. North-Holland, Amsterdam, 1969.
3. D. Miller. Documentation for lambda prolog. URL: http://lProlog/docs. htmlhttp://lProlog/docs.html.
4. D. Miller. Overview of linear logic programming. Accepted as a chapter for a book on linear logic, edited by Thomas Ehrhard, Jean-Yves Girard, Paul Ruet, and Phil Scott. Cambridge University Press. URL: http://papers/llp. pdfhttp://papers/llp.pdf.
5. D. Miller. A multiple-conclusion meta-logic. In S. Abramsky, editor, Ninth Annual IEEE Symp. on Logic in Computer Science, pages 272-281, Paris, July 1994.
6. D. Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165:201-232, 1996.
7. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
8. G. Nadathur and D. Miller. Higher-order Horn clauses. Journal of the ACM, 37(4):777-814, 1990.