Type of Talk: UTCS Colloquium/AI

Speaker/Affiliation: Gopa

l Gupta/UT Dallas

Date/Time: Friday, November 19, 2010, 11:00 a.m.

Location: PAI 3.14

Host: Vladimir Lifschitz

Talk Title: Logi

c, Co-induction and Infinite Computations

Talk Abstract: Coinduction

is a powerful technique for reasoning about unfounded sets, unbounded stru

ctures, infinite automata, and interactive computations. Where induction

corresponds to least fixed points semantics, co-induction corresponds to g

reatest fixed point semantics. In this talk I will give a tutorial introduc

tion to co-induction and show how co-induction can be elegantly incorporate

d into logic programming to obtain the co-inductive logic programming (co-L

P) paradigm. I will also discuss how co-LP can be elegantly used for sophis

ticated applications that include (i) model checking and verification, inc

luding of hybrid/cyber-physical systems and systems specified using the pi-

calculus (ii) planning and goal-directed execution of answer set programs t

hat perform non-monotonic reasoning.

Speaker Bio: Gopal Gupta received
his MS 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 Compute

r Science from IIT Kanpur in 1985. Currently he is a Professor and Head of

Computer Science at the University of Texas at Dallas. His research interes

ts are in logic programming, programming languages semantics/implementatio

n, and assistive technology. He has published extensively in these areas.

He serves as an area editor of the journal Theory and Practice of Logic Pro

gramming. He has served in the program committees of numerous conferences,
and since January 2010, has served as the President of the Association fo

r Logic Programming. His work on logic programming has been the basis of tw

o startup companies.