Document Type
Conference Proceeding
Publication Date
12-1-2007
Abstract
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and closed world reasoning for the Semantic Web. We present an extension based on a new three-valued framework including an alternating fixpoint, the well-founded MKNF model. This approach, the well-founded MKNF semantics, derives its name from the very close relation to the corresponding semantics known from logic programming. We show that the well-founded MKNF model is the least model among all (three-valued) MKNF models, thus soundly approximating also the two-valued MKNF models from [14]. Furthermore, its computation yields better complexity results (up to polynomial) than the original semantics where models usually have to be guessed.
Repository Citation
Knorr, M.,
Alferes, J. J.,
& Hitzler, P.
(2007). Towards Tractable Local Closed World Reasoning for the Semantic Web. Lecture Notes in Computer Science, 4874, 3-14.
https://corescholar.libraries.wright.edu/cse/142
DOI
10.1007/978-3-540-77002-2_1
Included in
Bioinformatics Commons, Communication Technology and New Media Commons, Databases and Information Systems Commons, OS and Networks Commons, Science and Technology Studies Commons
Comments
Presented at the 13th Portuguese Conference on Artificial Intelligence, Guimaraes, Portugal, December 3-7, 2007.
Attached is the unpublished, authors' version of this proceeding. The final, publisher's version can be found at http://dx.doi.org/10.1007/978-3-540-77002-2_1.