Logic, Co-induction and Infinite Computation

1 498
Published on 25 Jul 2018, 22:29
Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations. Where induction corresponds to least fixed points semantics, co-induction corresponds to greatest fixed point semantics. In this talk I will give a tutorial introduction to co-induction and show how co-induction can be elegantly incorporated into logic programming to obtain the co-inductive logic programming (co-LP) paradigm. I will also discuss how co-LP can be elegantly used for sophisticated applications that include (i) model checking and verification, including of hybrid/cyber-physical systems and systems specified using the pi-calculus (ii) planning and goal-directed execution of answer set programs that perform non-monotonic reasoning.

See more at microsoft.com/en-us/research/video/logic...
17 hours – 11 3950:16
Here to help: Talk to the pros
17 hours – 5 2060:16
Here to help: Do not disturb
news tech music