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. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
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). https://doi.org/10.1007/978-3-642-17796-5_7
Mendeley helps you to discover research relevant for your work.