|Title||Semantic Operators and Fixed-Point Theory in Logic Programming|
|Publication Type||Conference Paper|
|Year of Publication||2001|
|Authors||Anthony K. Seda, Pascal Hitzler|
|Conference Name||7th International Conference on Information Systems Analysis and Synthesis (ISAS 2001)|
|Conference Location||Orlando, Florida, USA|
We consider rather general operators mapping valuations to (sets of) valuations in the context of the semantics of logic programming languages. This notion generalizes several of the standard operators encountered in this subject and is inspired by earlier work of M.C. Fitting. The fixed points of such operators play a fundamental role in logic programming semantics by providing standard models of logic programs and also in determining the computability properties of these standard models. We discuss some of our recent work employing topological ideas, in conjunction with order theory, to establish methods by which one can nd the fixed points of the operators arising in logic programming semantics.
|Full Text|| |
Anthony K. Seda and Pascal Hitzler, 'Semantic Operators and Fixed-Point Theory in Logic Programming,' 7th International Conference on Information Systems Analysis and Synthesis (ISAS2001), Orlando, Florida, USA, July, 2001, pp. 224-229.