Logic programming: Laxness and saturation

Ekaterina Komendantskaya, Anthony Power

Research output: Contribution to journalArticle

17 Downloads (Pure)

Abstract

A propositional logic program P may be identified with a P f P f -coalgebra on the set of atomic propositions in the program. The corresponding C(P f P f )-coalgebra, where C(P f P f ) is the cofree comonad on P f P f , describes derivations by resolution. That correspondence has been developed to model first-order programs in two ways, with lax semantics and saturated semantics, based on locally ordered categories and right Kan extensions respectively. We unify the two approaches, exhibiting them as complementary rather than competing, reflecting the theorem-proving and proof-search aspects of logic programming. While maintaining that unity, we further refine lax semantics to give finitary models of logic programs with existential variables, and to develop a precise semantic relationship between variables in logic programming and worlds in local state.
Original languageEnglish
Pages (from-to)1-21
Number of pages21
JournalJournal of Logical and Algebraic Methods in Programming
Volume101
Early online date19 Jul 2018
DOIs
Publication statusPublished - 1 Dec 2018

    Fingerprint

Keywords

  • Logic programming, coalgebra, coinductive derivation tree, Lawvere theories, lax transformations, saturation

Cite this