Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Semantic Operators And Fixed-Point Theory In Logic Programming, Anthony K. Seda, Pascal Hitzler
Semantic Operators And Fixed-Point Theory In Logic Programming, Anthony K. Seda, Pascal Hitzler
Computer Science and Engineering Faculty Publications
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 find the fixed points …
Unique Supported-Model Classes Of Logic Programs, Pascal Hitzler, Anthony K. Seda
Unique Supported-Model Classes Of Logic Programs, Pascal Hitzler, Anthony K. Seda
Computer Science and Engineering Faculty Publications
We study classes of programs, herein called unique supported-model classes, with the property that each program in the class has a unique supported model. Elsewhere, the authors examined these classes from the point of view of operators defined relative to certain three-valued logics. In this paper, we complement our earlier results by considering how unique supported-model classes fit into the framework given by various classes of programs in several well-known approaches to semantics.
A New Fixed-Point Theorem For Logic Programming Semantics, Anthony K. Seda, Pascal Hitzler
A New Fixed-Point Theorem For Logic Programming Semantics, Anthony K. Seda, Pascal Hitzler
Computer Science and Engineering Faculty Publications
We present a new fixed-point theorem akin to the Banach contraction mapping theorem, but in the context of a novel notion of generalized metric space, and show how it can be applied to analyse the denotational semantics of certain logic programs. The theorem is obtained by generalizing a theorem of Priess-Crampe and Ribenboim, which grew out of applications within valuation theory, but is also inspired by a theorem of S.G. Matthews which grew out of applications to conventional programming language semantics. The class of programs to which we apply our theorem was defined previously by us in terms of operators …