Coalgebraic derivations in logic programming

Ekaterina Komendantskaya, John Power

    Research output: Chapter in Book/Report/Conference proceedingChapter

    11 Citations (Scopus)

    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 soundness, completeness, correctness and full abstraction results.
    Original languageEnglish
    Title of host publicationLeibniz International Proceedings in Informatics, LIPIcs
    PublisherDagstuhl Publications
    Pages352-366
    Number of pages15
    Volume12
    ISBN (Print)9783939897323
    DOIs
    Publication statusPublished - 2011

    Fingerprint

    Logic Programming
    Soundness
    Completeness
    Coalgebra
    Correctness
    Semantics

    Cite this

    Komendantskaya, E., & Power, J. (2011). Coalgebraic derivations in logic programming. In Leibniz International Proceedings in Informatics, LIPIcs (Vol. 12, pp. 352-366). Dagstuhl Publications. https://doi.org/10.4230/LIPIcs.CSL.2011.352
    Komendantskaya, Ekaterina ; Power, John. / Coalgebraic derivations in logic programming. Leibniz International Proceedings in Informatics, LIPIcs. Vol. 12 Dagstuhl Publications, 2011. pp. 352-366
    @inbook{7f035ac66b0b43f89969ee65b3f54929,
    title = "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 soundness, completeness, correctness and full abstraction results.",
    author = "Ekaterina Komendantskaya and John Power",
    year = "2011",
    doi = "10.4230/LIPIcs.CSL.2011.352",
    language = "English",
    isbn = "9783939897323",
    volume = "12",
    pages = "352--366",
    booktitle = "Leibniz International Proceedings in Informatics, LIPIcs",
    publisher = "Dagstuhl Publications",

    }

    Komendantskaya, E & Power, J 2011, Coalgebraic derivations in logic programming. in Leibniz International Proceedings in Informatics, LIPIcs. vol. 12, Dagstuhl Publications, pp. 352-366. https://doi.org/10.4230/LIPIcs.CSL.2011.352

    Coalgebraic derivations in logic programming. / Komendantskaya, Ekaterina; Power, John.

    Leibniz International Proceedings in Informatics, LIPIcs. Vol. 12 Dagstuhl Publications, 2011. p. 352-366.

    Research output: Chapter in Book/Report/Conference proceedingChapter

    TY - CHAP

    T1 - Coalgebraic derivations in logic programming

    AU - Komendantskaya, Ekaterina

    AU - Power, John

    PY - 2011

    Y1 - 2011

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=84880203100&partnerID=8YFLogxK

    U2 - 10.4230/LIPIcs.CSL.2011.352

    DO - 10.4230/LIPIcs.CSL.2011.352

    M3 - Chapter

    AN - SCOPUS:84880203100

    SN - 9783939897323

    VL - 12

    SP - 352

    EP - 366

    BT - Leibniz International Proceedings in Informatics, LIPIcs

    PB - Dagstuhl Publications

    ER -

    Komendantskaya E, Power J. Coalgebraic derivations in logic programming. In Leibniz International Proceedings in Informatics, LIPIcs. Vol. 12. Dagstuhl Publications. 2011. p. 352-366 https://doi.org/10.4230/LIPIcs.CSL.2011.352