Research

Coalgebraic semantics for parallel derivation strategies in logic programming


Reference:

Komendantskaya, E., McCusker, G. and Power, J., 2011. Coalgebraic semantics for parallel derivation strategies in logic programming. In: Johnson, M. and Pavlovic, D., eds. Algebraic Methodology and Software Technology. Vol. 6486. Springer-Verlag, pp. 111-127. (Lecture Notes in Computer Science)

Related documents:

[img]
Preview
PDF (AMAST-KMP10.pdf) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (275kB) | Preview

    Official URL:

    http://dx.doi.org/10.1007/978-3-642-17796-5_7

    Abstract

    Logic programming, a class of programming languages based on first-order logic, provides simple and efficient tools for goal-oriented proof-search. Logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either P f P f -coalgebras or P f List-coalgebras on Set. We analyse different kinds of derivation strategies and derivation trees (proof-trees, SLD-trees, and-or parallel trees) used in logic programming, and show how they can be modelled coalgebraically.

    Details

    Item Type Book Sections
    CreatorsKomendantskaya, E., McCusker, G. and Power, J.
    EditorsJohnson, M.and Pavlovic, D.
    DOI10.1007/978-3-642-17796-5_7
    DepartmentsFaculty of Science > Computer Science
    Publisher StatementAMAST-KMP10.pdf: The original publication is available at www.springerlink.com
    RefereedNo
    StatusPublished
    ID Code22704

    Export

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...