Coalgebraic derivations in logic programming

Ekaterina Komendantskaya; John Power

doi:10.4230/LIPIcs.CSL.2011.352

Coalgebraic derivations in logic programming

Ekaterina Komendantskaya, John Power

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

13 Citations (Scopus)

Abstract

Coalgebra may be used to provide semantics for SLD-derivations, both finite and infinite. We first give such semantics to classical SLD-derivations, proving results such as adequacy, soundness and completeness. Then, based upon coalgebraic semantics, we propose a new sound and complete algorithm for parallel derivations. We analyse this new algorithm in terms of the Theory of Observables, and we prove soundness, completeness, correctness and full abstraction results.

Original language	English
Title of host publication	Leibniz International Proceedings in Informatics, LIPIcs
Publisher	Dagstuhl Publications
Pages	352-366
Number of pages	15
Volume	12
ISBN (Print)	9783939897323
DOIs	https://doi.org/10.4230/LIPIcs.CSL.2011.352
Publication status	Published - 2011

Access to Document

10.4230/LIPIcs.CSL.2011.352

Cite this

@inbook{7f035ac66b0b43f89969ee65b3f54929,

title = "Coalgebraic derivations in logic programming",

abstract = "Coalgebra may be used to provide semantics for SLD-derivations, both finite and infinite. We first give such semantics to classical SLD-derivations, proving results such as adequacy, soundness and completeness. Then, based upon coalgebraic semantics, we propose a new sound and complete algorithm for parallel derivations. We analyse this new algorithm in terms of the Theory of Observables, and we prove soundness, completeness, correctness and full abstraction results.",

author = "Ekaterina Komendantskaya and John Power",

year = "2011",

doi = "10.4230/LIPIcs.CSL.2011.352",

language = "English",

isbn = "9783939897323",

volume = "12",

pages = "352--366",

booktitle = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Dagstuhl Publications",

}

TY - CHAP

T1 - Coalgebraic derivations in logic programming

AU - Komendantskaya, Ekaterina

AU - Power, John

PY - 2011

Y1 - 2011

N2 - Coalgebra may be used to provide semantics for SLD-derivations, both finite and infinite. We first give such semantics to classical SLD-derivations, proving results such as adequacy, soundness and completeness. Then, based upon coalgebraic semantics, we propose a new sound and complete algorithm for parallel derivations. We analyse this new algorithm in terms of the Theory of Observables, and we prove soundness, completeness, correctness and full abstraction results.

AB - Coalgebra may be used to provide semantics for SLD-derivations, both finite and infinite. We first give such semantics to classical SLD-derivations, proving results such as adequacy, soundness and completeness. Then, based upon coalgebraic semantics, we propose a new sound and complete algorithm for parallel derivations. We analyse this new algorithm in terms of the Theory of Observables, and we prove soundness, completeness, correctness and full abstraction results.

UR - http://www.scopus.com/inward/record.url?scp=84880203100&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.CSL.2011.352

DO - 10.4230/LIPIcs.CSL.2011.352

M3 - Chapter

AN - SCOPUS:84880203100

SN - 9783939897323

VL - 12

SP - 352

EP - 366

BT - Leibniz International Proceedings in Informatics, LIPIcs

PB - Dagstuhl Publications

ER -

Coalgebraic derivations in logic programming

Abstract

Access to Document

Other files and links

Fingerprint

Exploiting parallelism in coalgebraic logic programming

Cite this