Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Coalgebraic Semantics for Derivations in Logic Programming
verfasst von : Ekaterina Komendantskaya, John Power
Erschienen in: Algebra and Coalgebra in Computer Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Every variable-free logic program induces a
P
f
P
f
-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
f
P
f
-coalgebra on Set and showed that, if
C
(
P
f
P
f
) is the cofree comonad on
P
f
P
f
, then given a logic program
P
qua
P
f
P
f
-coalgebra, the corresponding
C
(
P
f
P
f
)-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.