A Tutorial on Proof Theoretic Foundations of Logic Programming

P Bruscoli; A Guglielmi

doi:10.1007/b94619

A Tutorial on Proof Theoretic Foundations of Logic Programming

P Bruscoli, A Guglielmi

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter

1 Citation (Scopus)

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.

Original language	English
Title of host publication	Logic Programming, 19th International Conference - Lecture Notes in Computer Science
Publisher	Springer
Pages	109-127
Number of pages	19
Volume	2916
ISBN (Print)	3-540-20642-6
DOIs	https://doi.org/10.1007/b94619
Publication status	Published - 2003

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer-Verlag

Access to Document

10.1007/b94619

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

Fingerprint Dive into the research topics of 'A Tutorial on Proof Theoretic Foundations of Logic Programming'. Together they form a unique fingerprint.

Cite this

@inbook{4356d794ef5a4afbbda1aa7e98b6b48a,

title = "A Tutorial on Proof Theoretic Foundations of Logic Programming",

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.",

author = "P Bruscoli and A Guglielmi",

year = "2003",

doi = "10.1007/b94619",

language = "English",

isbn = "3-540-20642-6",

volume = "2916",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "109--127",

booktitle = "Logic Programming, 19th International Conference - Lecture Notes in Computer Science",

}

TY - CHAP

T1 - A Tutorial on Proof Theoretic Foundations of Logic Programming

AU - Bruscoli, P

AU - Guglielmi, A

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

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

U2 - 10.1007/b94619

DO - 10.1007/b94619

M3 - Chapter

SN - 3-540-20642-6

VL - 2916

T3 - Lecture Notes in Computer Science

SP - 109

EP - 127

BT - Logic Programming, 19th International Conference - Lecture Notes in Computer Science

PB - Springer

ER -