TY - CHAP
T1 - Coalgebraic Derivations in Logic Programming
AU - Komendantskaya, E
AU - Power, J
N1 - Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway.
PY - 2011/9
Y1 - 2011/9
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://dx.doi.org/10.4230/LIPIcs.CSL.2011.352
U2 - 10.4230/LIPIcs.CSL.2011.352
DO - 10.4230/LIPIcs.CSL.2011.352
M3 - Chapter or section
SN - 978-3-939897-32-3
T3 - Leibniz International Proceedings in Informatics (LIPIcs)
SP - 352
EP - 366
BT - Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL
A2 - Bezem, M
PB - Leibniz International Proceedings in Informatics
CY - Dagstuhl, Germany
ER -