Coalgebraic derivations in logic programming

Ekaterina Komendantskaya, John Power

    Research output: Chapter in Book/Report/Conference proceedingChapter

    12 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 Dive into the research topics of 'Coalgebraic derivations in logic programming'. Together they form a unique fingerprint.

  • Research Output

    • 12 Citations
    • 1 Article

    Exploiting parallelism in coalgebraic logic programming

    Komendantskaya, E., Schmidt, M. & Heras, J., 28 Mar 2014, In : Electronic Notes in Theoretical Computer Science. 303, p. 121-148 28 p., ENTCS18421.

    Research output: Contribution to journalArticle

    Open Access
    File
  • 3 Citations (Scopus)
    278 Downloads (Pure)

    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