Links' Seminars and Public Events Add to google calendar
Wed, January 11, 2017
2:15 pm
3:25 pm
Add event to google
Michael vanden Boom, Oxford University : Decidable fixpoint logics
Fixpoint logics can express dynamic, recursive properties, but often fail to have decidable satisfiability. A notable exception to this is the family of well-behaved "guarded" fixpoint logics,
which subsume a variety of query languages and integrity constraints of interest in databases and knowledge representation. In this talk, I will survey some recent results about these logics.
Show in Google map
Lille B21
Mon, January 9, 2017
to Fri, January 13, 2017
 all day
Add event to google
Visite Michael vanden Boom, Oxford University

Permanent link to this article: