Research

A Tutorial on Proof Theoretic Foundations of Logic Programming


Reference:

Bruscoli, P. and Guglielmi, A., 2003. A Tutorial on Proof Theoretic Foundations of Logic Programming. In: Logic Programming, 19th International Conference - Lecture Notes in Computer Science. Vol. 2916. Springer, pp. 109-127. (Lecture Notes in Computer Science)

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.

Official URL:

http://dx.doi.org/10.1007/b94619

Abstract

Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, endowed with a rich meta theory. This tutorial intends to expose the main ideas of this discipline in the most direct and simple way.

Details

Item Type Book Sections
CreatorsBruscoli, P.and Guglielmi, A.
DOI10.1007/b94619
DepartmentsFaculty of Science > Computer Science
StatusPublished
ID Code5552

Export

Actions (login required)

View Item