Komendantskaya, E. and Power, J., 2011. Coalgebraic Derivations in Logic Programming. In: Bezem, M., ed. Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 352-366. (Leibniz International Proceedings in Informatics (LIPIcs))
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.
|Item Type ||Book Sections|
|Creators||Komendantskaya, E.and Power, J.|
|Departments||Faculty of Science > Computer Science|
|Publisher Statement||Power_CSL_2011.pdf: © E.Komendantskaya and J.Power; licensed under Creative Commons License NC-ND|
|Additional Information||Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway.|
Actions (login required)