LIPIcs.CSL.2011.352.pdf
- Filesize: 0.58 MB
- 15 pages
Document
Coalgebraic Derivations in Logic Programming
Authors
-
Part of:
Volume:
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (CSL 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-08-31
Cite AsGet BibTex
Ekaterina Komendantskaya and John Power. Coalgebraic Derivations in Logic Programming. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 352-366, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.CSL.2011.352
https://doi.org/10.4230/LIPIcs.CSL.2011.352
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.
Keywords
- Logic programming
- SLD-resolution
- concurrency
- coinduction
- Lawvere theoriesm
- coinductive logic programming
- concurrent logic programming
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads