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.
Type de document :
Rapport
[Research Report] RR-1818, INRIA. 1992
Liste complète des métadonnées

https://hal.inria.fr/inria-00074854
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:34:59
Dernière modification le : vendredi 16 septembre 2016 - 15:19:38
Document(s) archivé(s) le : mardi 12 avril 2011 - 19:44:31

Fichiers

Identifiants

  • HAL Id : inria-00074854, version 1

Collections

Citation

Miguel Suarez. A Proof-theoretic approach to logic programming. [Research Report] RR-1818, INRIA. 1992. 〈inria-00074854〉

Partager

Métriques

Consultations de la notice

204

Téléchargements de fichiers

65