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 › Conference contribution

13 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
Place of Publication	Berlin
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
Event	13th International Conference on Algebraic Methodology and Software Technology - Lac Beauport, Canada Duration: 23 Jun 2010 → 25 Jun 2010 http://mpc-amast2010.fsg.ulaval.ca/amast/

Publication series

Name	Lecture notes in computer science
Publisher	Springer
Volume	6486

Conference

Conference	13th International Conference on Algebraic Methodology and Software Technology
Abbreviated title	AMAST2010
Country/Territory	Canada
City	Lac Beauport
Period	23/06/10 → 25/06/10
Internet address	http://mpc-amast2010.fsg.ulaval.ca/amast/

Keywords

Logic programming
SLD-resolution
Parallel Logic programming
Coalgebra
Coinduction

Access to Document

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

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. Berlin : Springer , 2011. pp. 111-127 (Lecture notes in computer science).

@inproceedings{831064bf625241e790c485a8a4852ee1,

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

note = "13th International Conference on Algebraic Methodology and Software Technology, AMAST2010 ; Conference date: 23-06-2010 Through 25-06-2010",

url = "http://mpc-amast2010.fsg.ulaval.ca/amast/",

}

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 , Berlin, pp. 111-127, 13th International Conference on Algebraic Methodology and Software Technology, Lac Beauport, Canada, 23/06/10. 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. Berlin : Springer , 2011. p. 111-127 (Lecture notes in computer science; Vol. 6486).

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

TY - GEN

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

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

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

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

M3 - Conference contribution

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

CY - Berlin

T2 - 13th International Conference on Algebraic Methodology and Software Technology

Y2 - 23 June 2010 through 25 June 2010

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. Berlin: 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

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this