Coalgebraic Derivations in Logic Programming

E Komendantskaya, J Power

Research output: Chapter or section in a book/report/conference proceedingChapter or section

13 Citations (SciVal)
73 Downloads (Pure)


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 languageEnglish
Title of host publicationComputer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL
EditorsM Bezem
Place of PublicationDagstuhl, Germany
PublisherLeibniz International Proceedings in Informatics
Number of pages15
ISBN (Print)978-3-939897-32-3
Publication statusPublished - Sept 2011

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl-Leibniz-Zentrum fuer Informatik

Bibliographical note

Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway.


Dive into the research topics of 'Coalgebraic Derivations in Logic Programming'. Together they form a unique fingerprint.

Cite this