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
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Reasoning about termination of pure Prolog programs
Information and Computation
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Generalized metrics and uniquely determined logic programs
Theoretical Computer Science - Topology in computer science
Reasoning with infinite stable models
Artificial Intelligence
A uniform approach to logic programming semantics
Theory and Practice of Logic Programming
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
WSMO-MX: A hybrid Semantic Web service matchmaker
Web Intelligence and Agent Systems
Rules and logic programming for the web
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Hi-index | 0.00 |
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of rule systems for ontology reasoning, and also investigated as to its usefulness as a semantics for hybrid systems featuring combined open- and closed-world reasoning. Even in its most basic form, however, the WFS is undecidable. In fact, it is not even semi-decidable, which means that it is a theoretical impossibility that sound and complete reasoners for the WFS exist. Surprisingly, however, this matter has received next to no attention in research, although it has already been shown in 1995 by John Schlipf [1]. In this paper, we present several conditions under which query-answering under the well-founded semantics is decidable or semi-decidable. To the best of our knowledge, these are the very first results on such conditions.