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

^*Corresponding author for this work

School of Computer Science

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

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	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	111-127
Number of pages	17
Volume	6486 LNCS
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, AMAST 2010 - Lac-Beauport, QC, Canada Duration: 23 Jun 2010 → 25 Jun 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6486 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Conference

Conference	13th International Conference on Algebraic Methodology and Software Technology, AMAST 2010
Country/Territory	Canada
City	Lac-Beauport, QC
Period	23/06/10 → 25/06/10

Keywords

Coalgebra
Coinduction
Logic programming
Parallel Logic programming
SLD-resolution

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6486 LNCS, pp. 111-127). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6486 LNCS). 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6486 LNCS 2011. pp. 111-127 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{90f91e2ce9714775af7a048d10f06e46,

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 = "Coalgebra, Coinduction, Logic programming, Parallel Logic programming, SLD-resolution",

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

year = "2011",

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

language = "English",

isbn = "3642177956",

volume = "6486 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "111--127",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

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

}

Komendantskaya, E, McCusker, G & Power, J 2011, Coalgebraic semantics for parallel derivation strategies in logic programming. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6486 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6486 LNCS, pp. 111-127, 13th International Conference on Algebraic Methodology and Software Technology, AMAST 2010, Lac-Beauport, QC, 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.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6486 LNCS 2011. p. 111-127 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6486 LNCS).

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 - Coalgebra

KW - Coinduction

KW - Logic programming

KW - Parallel Logic programming

KW - SLD-resolution

UR - https://www.scopus.com/pages/publications/79551537168

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

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

M3 - Conference contribution

AN - SCOPUS:79551537168

SN - 3642177956

SN - 9783642177958

VL - 6486 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 111

EP - 127

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

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

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6486 LNCS. 2011. p. 111-127. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). 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

Fellowship CLANN EP/F044046/1: Computational Logic in Artificial Neural Networks

Cite this

Coalgebraic semantics for parallel derivation strategies in logic programming

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Projects

Fellowship CLANN EP/F044046/1: Computational Logic in Artificial Neural Networks

Cite this