"Logic, Coinduction and Infinite Computations"
Gopal Gupta, CS Department Head
Abstract
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, coinduction corresponds to greatest fixed point semantics. In this talk I will give a tutorial introduction to coinduction and show how it can be elegantly incorporated into logic programming to obtain the coinductive 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 for hybrid systems, and (ii) planning and goal-directed execution of answer set programs (used for non-monotonic reasoning).
Bio
Gopal Gupta received his M.S. and Ph.D. in computer science from the University of North Carolina at Chapel Hill in 1987 and 1991, respectively, and his B. Tech. in computer science from IIT Kanpur in 1985. Currently he is a professor and head of Computer Science at UT Dallas. His research interests are in logic programming, programming languages semantics and implementation, assistive technology, service-oriented computing and software engineering. He has published extensively in these areas. He serves as an area editor of the journal Theory and Practice of Logic Programming. He has also served on the program committees of numerous conferences and is a past member of the Executive Council of the Association for Logic Programming. His work has been funded by several federal (NSF, DOEd, EPA,
DHS) and international (NATO, AITEC of Japan) agencies. His work on logic programming has been the basis for two startup companies.
[an error occurred while processing this directive]