Coalgebraic Derivations in Logic Programming


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))

Related documents:

PDF (Power_CSL_2011.pdf) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (2054kB) | Preview

    Related URLs:


    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
    CreatorsKomendantskaya, E.and Power, J.
    EditorsBezem, M.
    Related URLs
    URLURL Type Full-text
    DepartmentsFaculty of Science > Computer Science
    Publisher StatementPower_CSL_2011.pdf: © E.Komendantskaya and J.Power; licensed under Creative Commons License NC-ND
    ID Code26434
    Additional InformationComputer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway.


    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...