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.
|Title of host publication||Logic Programming, 19th International Conference - Lecture Notes in Computer Science|
|Number of pages||19|
|Publication status||Published - 2003|
|Name||Lecture Notes in Computer Science|
Bruscoli, P., & 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, pp. 109-127). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/b94619