y
Download:
|
|
by Yuli Zhou, Robert Muller
http://oak.bc.edu/~muller/postscript/alp90.ps.Z
Add To MetaCart
Abstract:
We prove several lattice theoretical xpoint theorems based on the classical theorem of Knaster and Tarski. These theorems give sucient conditions for a system of generally nonmonotonic functions on a complete lattice to dene a unique minimal xpoint. The primary objective of this paper is to develop a domain theoretic framework to study the semantics of logic programs as well as various rulebased systems where the rules dene generally nonmonotonic functions on lattices.
Citations
| 615 | The semantics of Predicate Logic as a Programming Language – Emden, Kowalski - 1976 |
| 557 | Towards a theory of Declarative Knowledge – Apt, Blair, et al. - 1988 |
| 383 | Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory – Stoy - 1977 |
| 340 | A lattice-theoretical fixed point theorem and its applications – Tarski - 1955 |
| 183 | The lambda calculus, its syntax and semantics. Revised edition edn – Barendregt - 1984 |
| 173 | Contributions to the theory of logic programming – Apt, Emden - 1989 |
| 22 | Foundations of logic programming; (2nd extended ed – Lloyd - 1987 |
| 21 | Semantical paradigms: Notes for an invited lecture – Meyer - 1988 |
| 5 | Sets and Axioms: the apparatus of mathematics – Numbers - 1982 |
| 2 | Negation in Logic Programming – Shepardson |
