![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
John Power (University of Bath)
Tuesday 24 January 2017, 14:15-15:15
Logic programming: laxness and saturation
- đ¤ Speaker: John Power (University of Bath)
- đ Date & Time: Tuesday 24 January 2017, 14:15 - 15:15
- đ Venue: MR5, Centre for Mathematical Sciences
Abstract
(joint with Ekaterina Komendantskaya)
A propositional logic program P may be identified with a (Pf Pf)-coalgebra on the set of atomic propositions in the program. The corresponding C-coalgebra, where C is the cofree comonad on Pf Pf, 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 progams with existential variables, and to develop a precise semantic relationship between variables in logic programming and worlds in local state.
Series This talk is part of the Category Theory Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Category Theory Seminar
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR5, Centre for Mathematical Sciences
- ndb35's list
- School of Physical Sciences
- yk373's list
Note: Ex-directory lists are not shown.