License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2011.352
URN: urn:nbn:de:0030-drops-32424
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3242/
Komendantskaya, Ekaterina ;
Power, John
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 correctness and full abstraction results.
BibTeX - Entry
@InProceedings{komendantskaya_et_al:LIPIcs:2011:3242,
author = {Ekaterina Komendantskaya and John Power},
title = {{Coalgebraic Derivations in Logic Programming}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {352--366},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Marc Bezem},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3242},
URN = {urn:nbn:de:0030-drops-32424},
doi = {10.4230/LIPIcs.CSL.2011.352},
annote = {Keywords: Logic programming, SLD-resolution, concurrency, coinduction, Lawvere theoriesm, coinductive logic programming, concurrent logic programming}
}
Keywords: |
|
Logic programming, SLD-resolution, concurrency, coinduction, Lawvere theoriesm, coinductive logic programming, concurrent logic programming |
Collection: |
|
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL |
Issue Date: |
|
2011 |
Date of publication: |
|
31.08.2011 |