Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Weakly stratified logic programs
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Acyclic logic programs and the completeness of SLDNF-resolution
Theoretical Computer Science
Logic of domains
Totally bounded spaces and compact ordered spaces as domains of computation
Topology and category theory in computer science
Reasoning about termination of pure Prolog programs
Information and Computation
Mathematical theory of domains
Mathematical theory of domains
Elements of generalized ultrametric domain theory
Theoretical Computer Science
Quasi-metrics and the semantics of logic programs
Fundamenta Informaticae
A computational model for metric spaces
Theoretical Computer Science
Clausal logic and logic programming in algebraic domains
Information and Computation
Approximating the Semantics of Logic Programs by Recurrent Neural Networks
Applied Intelligence
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
The Query Topology in Logic Programming
STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Quasi Uniformities: Reconciling Domains with Metric Spaces
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
Complexity of Power Default Reasoning
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Metric Domains for Completeness
Metric Domains for Completeness
Topological aspects of logic programming
Topological aspects of logic programming
A note on the relationships between logic programs and neural networks
IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods
Topology And The Semantics Of Logic Programs
Fundamenta Informaticae
The Well-Founded Semantics Is a Stratified Fitting Semantics
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
A geometric interpretation of LD-resolution
Theoretical Computer Science - Logic, semantics and theory of programming
A uniform approach to logic programming semantics
Theory and Practice of Logic Programming
Generalized ultrametric spaces in quantitative domain theory
Theoretical Computer Science
A resolution theorem for algebraic domains
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Decidability under the well-founded semantics
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Modeling timed concurrent systems
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
On fixed points of strictly causal functions
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
An axiomatization of the theory of generalized ultrametric semilattices of linear signals
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
The introduction of negation into logic programming brings the benefit of enhanced syntax and expressibility, but creates some semantical problems. Specifically, certain operators which are monotonic in the absence of negation become non-monotonic when it is introduced, with the result that standard approaches to denotational semantics then become inapplicable. In this paper, we show how generalized metric spaces can be used to obtain fixed-point semantics for several classes of programs relative to the supported model semantics, and investigate relationships between the underlying spaces we employ. Our methods allow the analysis of classes of programs which include the acyclic, locally hierarchical, and acceptable programs, amongst others, and draw on fixed-point theorems which apply to generalized ultrametric spaces and to partial metric spaces.