Library
. The Fixed-Point Theorems of Priess-Crampe and Ribenboim in Logic Programming. In 2002. 
(0 bytes)
(0 bytes). Acceptable Programs Revisited. In Workshop on Verification in Logic Programming, 16th International Conference on Logic Programming (ICLP'99),; 1999. 
(1.1 MB)
(1.1 MB). A Characterization of Acceptability. In A Characterization of Acceptability. 1999.
. Characterizations of Classes of Programs by Three-valued Operators. In Characterizations of Classes of Programs by Three-valued Operators. 1999. (0 bytes)
(0 bytes). Classes of Logic Programs which Possess Unique Supported Models. In Classes of Logic Programs which Possess Unique Supported Models. 2000. (0 bytes)
(0 bytes). On the Coincidence of Semantics for Uniquely Determined Programs. In On the Coincidence of Semantics for Uniquely Determined Programs. 2000.
. Continuity of Semantic Operators in Logic Programming and their Approximation by Artificial Neural Networks. In the 26th Annual German Conference on Artificial Intelligence, KI2003. Hamburg, Germany; 2003. p. 105-119. (247.39 KB)
(247.39 KB). Multivalued Mappings, Fixed-Point Theorems and Disjunctive Databases. In Electronic Workshops in Computing, British Computer Society; 1999. (0 bytes)
(0 bytes). A New Fixed-point Theorem for Logic Programming Semantics. In SCI2000 and ISAS2000. Orlando, Florida, USA; 2000. p. 418-423.
. Semantic Operators and Fixed-Point Theory in Logic Programming. In 7th International Conference on Information Systems Analysis and Synthesis (ISAS 2001). Orlando, Florida, USA; 2001. p. 224-229. (1.77 MB)
(1.77 MB). Strictly Level-Decreasing Logic Programs. In the Second Irish Workshop on Formal Methods; 1998. (0 bytes)
(0 bytes). A "Converse" of the Bananch Contraction Mapping Theorem. Journal of Electrical Engineering. 2001 ;:3-6. (172.7 KB)
(172.7 KB). Dislocated Topologies. 2000 ;. (170.64 KB)
(170.64 KB). Generalized Distance Functions in the Theory of Computation. The Computer Journal. 2010 ;:443-464. (391.22 KB)
(391.22 KB). Generalized Metrics and Uniquely Determined Logic Programs. Theoretical Computer Science. 2003 ;:187-219. (419.06 KB)
(419.06 KB). Some Issues Concerning Fixed-Points in Computational Logic: Quasi-Metrics, Multivalued Mappings and the Knaster-Tarski Theorem. Topology Proceedings. 1999 ;:223-250. (251.14 KB)
(251.14 KB). Unique Supported-Model Classes of Logic Programs. Information. 2001 ;:295-302. (177.12 KB)
(177.12 KB). Dislocated Topologies. 2000.
. A Topological View of Acceptability. 2000.