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

address = "Switzerland",

}