@inbook{ffc230ad9c71418aa92fb2122f72d4b6,
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.",
keywords = "Logic programming, SLD-resolution, concurrency, coinduction, Lawvere theoriesm, coinductive logic programming, concurrent logic programming",
author = "Ekaterina Komendantskaya and John Power",
year = "2011",
doi = "10.4230/LIPIcs.CSL.2011.352",
language = "English",
isbn = "9783939897323",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "352--366",
booktitle = "Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL",
}