A Proof-theoretic approach to logic programming - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

A Proof-theoretic approach to logic programming

Abstract

We develop the foundations of Horn clause logic programming in a proof-theoretic style. We present a formal unification system for first order terms including a syntactic representation of environments and formalisms for the bottom-up and top down computation of answers in a unified formal setting. In passing, we propose an abstrac unification machine. We also discuss the possibility and implications of representing logic program evaluation strategies in the lambda calculus.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1818.pdf (4.43 Mo) Télécharger le fichier

Dates and versions

inria-00074854 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074854 , version 1

Cite

Miguel Suarez. A Proof-theoretic approach to logic programming. [Research Report] RR-1818, INRIA. 1992. ⟨inria-00074854⟩
91 View
63 Download

Share

Gmail Facebook X LinkedIn More