Fixpoints And Minimal Model Reasoning

Prof. Carolina Ruiz
WPI Computer Science Department

Friday, October 18, 1996
11 a.m. - 12 noon
Fuller Labs 311

I briefly survey the basic results in Fixpoint Theory and discuss applications of those results to Programming Languages, Databases, and Automated Reasoning. In particular, I describe an operator whose least fixed-point characterizes minimal model reasoning in Logic Programming. The problem of whether this operator is continuous has been open. I show that the operator is not continuous but that it nevertheless reaches its least fixed-point in at most w iterations.

This is joint work with Dietmar Seipel (Univ. of Wuerzburg) and Jack Minker (Univ. of Maryland).

Maintained by webmaster@wpi.edu
Last modified: Sep 27, 2006, 16:05 EDT