@inbook{baf3d6a901c249e1affaa7692260c170,

title = "Coalgebraic Semantics for Derivations in Logic Programming",

abstract = "Every variable-free logic program induces a P P -coalgebra on the set of atomic formulae in the program. The coalgebra p sends an atomic formula A to the set of the sets of atomic formulae in the antecedent of each clause for which A is the head. In an earlier paper, we identified a variable-free logic program with a P P -coalgebra on Set and showed that, if C(P P ) is the cofree comonad on P P , then given a logic program P qua P P -coalgebra, the corresponding C(P P )-coalgebra structure describes the parallel and-or derivation trees of P. In this paper, we extend that analysis to arbitrary logic programs. That requires a subtle analysis of lax natural transformations between Poset-valued functors on a Lawvere theory, of locally ordered endofunctors and comonads on locally ordered categories, and of coalgebras, oplax maps of coalgebras, and the relationships between such for locally ordered endofunctors and the cofree comonads on them.",

keywords = "Logic programming, SLD-resolution, Coalgebra, Lawvere theories, Lax natural transformations, Oplax maps of coalgebras",

author = "Ekaterina Komendantskaya and John Power",

year = "2011",

doi = "10.1007/978-3-642-22944-2_19",

language = "English",

isbn = "9783642229435",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "268--282",

editor = "Andrea Corradini and Bartek Klin and Corina C{\^i}rstea",

booktitle = "Algebra and Coalgebra in Computer Science",

}