Chrome Extension
WeChat Mini Program
Use on ChatGLM

Logic Programming: Laxness and Saturation.

˜The œJournal of logical and algebraic methods in programming/Journal of logical and algebraic methods in programming(2018)

Cited 6|Views24
No score
Abstract
A propositional logic program P may be identified with a PfPf-coalgebra on the set of atomic propositions in the program. The corresponding C(PfPf)-coalgebra, where C(PfPf) is the cofree comonad on PfPf, 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.
More
Translated text
Key words
Logic programming,Coalgebra,Coinductive derivation tree,Lawvere theories,Lax transformations,Saturation
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined