The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Semantic Matchmaking of Web Resources with Local Closed-World Reasoning
International Journal of Electronic Commerce
Embedding non-ground logic programs into autoepistemic logic for knowledge-base combination
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A faithful integration of description logics with logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Nonmonotonic databases and epistemic queries
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Guarded open answer set programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Matching semantic service descriptions with local closed-world reasoning
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Can OWL and logic programming live together happily ever after?
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Local closed world reasoning with description logics under the well-founded semantics
Artificial Intelligence
| Hi-index | 0.00 |
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.