Coalgebraic semantics for parallel derivation strategies in logic programming

Ekaterina Komendantskaya, Guy McCusker, John Power

Research output: Chapter in Book/Report/Conference proceedingChapter

  • 8 Citations

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.
LanguageEnglish
Title of host publicationAlgebraic Methodology and Software Technology
EditorsMichael Johnson, Dusko Pavlovic
PublisherSpringer
Pages111-127
Number of pages17
Volume6486
ISBN (Print)978-3-642-17795-8
DOIs
StatusPublished - 2011

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag

Fingerprint

Logic programming
Semantics
Computer programming languages
Functional programming

Cite this

Komendantskaya, E., McCusker, G., & Power, J. (2011). Coalgebraic semantics for parallel derivation strategies in logic programming. In M. Johnson, & D. Pavlovic (Eds.), Algebraic Methodology and Software Technology (Vol. 6486, pp. 111-127). (Lecture Notes in Computer Science). Springer. DOI: 10.1007/978-3-642-17796-5_7

Coalgebraic semantics for parallel derivation strategies in logic programming. / Komendantskaya, Ekaterina; McCusker, Guy; Power, John.

Algebraic Methodology and Software Technology. ed. / Michael Johnson; Dusko Pavlovic. Vol. 6486 Springer, 2011. p. 111-127 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

Komendantskaya, E, McCusker, G & Power, J 2011, Coalgebraic semantics for parallel derivation strategies in logic programming. in M Johnson & D Pavlovic (eds), Algebraic Methodology and Software Technology. vol. 6486, Lecture Notes in Computer Science, Springer, pp. 111-127. DOI: 10.1007/978-3-642-17796-5_7
Komendantskaya E, McCusker G, Power J. Coalgebraic semantics for parallel derivation strategies in logic programming. In Johnson M, Pavlovic D, editors, Algebraic Methodology and Software Technology. Vol. 6486. Springer. 2011. p. 111-127. (Lecture Notes in Computer Science). Available from, DOI: 10.1007/978-3-642-17796-5_7
Komendantskaya, Ekaterina ; McCusker, Guy ; Power, John. / Coalgebraic semantics for parallel derivation strategies in logic programming. Algebraic Methodology and Software Technology. editor / Michael Johnson ; Dusko Pavlovic. Vol. 6486 Springer, 2011. pp. 111-127 (Lecture Notes in Computer Science).
@inbook{f3d3eecec7774fcebd09a45cb0e030bd,
title = "Coalgebraic semantics for parallel derivation strategies in logic programming",
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.",
author = "Ekaterina Komendantskaya and Guy McCusker and John Power",
year = "2011",
doi = "10.1007/978-3-642-17796-5_7",
language = "English",
isbn = "978-3-642-17795-8",
volume = "6486",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "111--127",
editor = "Michael Johnson and Dusko Pavlovic",
booktitle = "Algebraic Methodology and Software Technology",

}

TY - CHAP

T1 - Coalgebraic semantics for parallel derivation strategies in logic programming

AU - Komendantskaya,Ekaterina

AU - McCusker,Guy

AU - Power,John

PY - 2011

Y1 - 2011

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

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

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

U2 - 10.1007/978-3-642-17796-5_7

DO - 10.1007/978-3-642-17796-5_7

M3 - Chapter

SN - 978-3-642-17795-8

VL - 6486

T3 - Lecture Notes in Computer Science

SP - 111

EP - 127

BT - Algebraic Methodology and Software Technology

PB - Springer

ER -