Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming

Ekaterina Komendantskaya; Guy McCusker; John Power

doi:10.1007/978-3-642-17796-5_7

Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming

Ekaterina Komendantskaya, Guy McCusker, John Power

Research output: Chapter in Book/Report/Conference proceeding › Chapter

14 Citations (Scopus)

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.

Original language	English
Title of host publication	Algebraic Methodology and Software Technology
Subtitle of host publication	13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers
Editors	Michael Johnson, Dusko Pavlovic
Publisher	Springer
Pages	111-127
Number of pages	17
ISBN (Electronic)	9783642177965
ISBN (Print)	9783642177958
DOIs	https://doi.org/10.1007/978-3-642-17796-5_7
Publication status	Published - 2011

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	6486
ISSN (Print)	0302-9743

Keywords

Logic programming
SLD-resolution
Parallel Logic programming
Coalgebra
Coinduction

Access to Document

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

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

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: 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers (pp. 111-127). (Lecture Notes in Computer Science; Vol. 6486). Springer. https://doi.org/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: 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers. editor / Michael Johnson ; Dusko Pavlovic. Springer, 2011. pp. 111-127 (Lecture Notes in Computer Science).

@inbook{1b3fc69d14554de3a2ca85a67b49281c,

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.",

keywords = "Logic programming, SLD-resolution, Parallel Logic programming, Coalgebra, Coinduction",

author = "Ekaterina Komendantskaya and Guy McCusker and John Power",

year = "2011",

doi = "10.1007/978-3-642-17796-5_7",

language = "English",

isbn = "9783642177958",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "111--127",

editor = "Michael Johnson and Dusko Pavlovic",

booktitle = "Algebraic Methodology and Software Technology",

}

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: 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers. Lecture Notes in Computer Science, vol. 6486, Springer, pp. 111-127. https://doi.org/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: 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers. ed. / Michael Johnson; Dusko Pavlovic. Springer, 2011. p. 111-127 (Lecture Notes in Computer Science; Vol. 6486).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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.

KW - Logic programming

KW - SLD-resolution

KW - Parallel Logic programming

KW - Coalgebra

KW - Coinduction

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

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

M3 - Chapter

SN - 9783642177958

T3 - Lecture Notes in Computer Science

SP - 111

EP - 127

BT - Algebraic Methodology and Software Technology

A2 - Johnson, Michael

A2 - Pavlovic, Dusko

PB - Springer

ER -

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: 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers. Springer. 2011. p. 111-127. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-17796-5_7

Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Cite this