|
Organizers |
Topology and Iterates in Computational Logic
by
Anthony K. Seda
Department of Mathematics, University College Cork, Ireland
Coauthors: Pascal Hitzler (Department of Mathematics, University of Tuebingen, Germany)
We consider the problem of finding models of logic programs P via fixed points of immediate consequence operators, TP. Certain extensions of syntax invalidate the conventional approach using iterates of TP and the Knaster-Tarski theorem. We discuss (i) alternatives to the use of this theorem based on generalized metrics and elementary topological notions, and (ii) simple syntactic conditions on P which ensure convergence (to fixed points) of the requisite sequences of iterates.
Date received: June 24, 1997
Copyright © 1997 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caao-22.