Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Closed world reasoning in Hybrid systems
Methodologies for intelligent systems, 5
An efficient method for eliminating varying predicates from a circumscription
Artificial Intelligence
Description logics of minimal knowledge and negation as failure
ACM Transactions on Computational Logic (TOCL)
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
POLICY '03 Proceedings of the 4th IEEE International Workshop on Policies for Distributed Systems and Networks
Analyzing web access control policies
Proceedings of the 16th international conference on World Wide Web
Using OWL to model biological knowledge
International Journal of Human-Computer Studies
ROWLBAC: representing role based access control in OWL
Proceedings of the 13th ACM symposium on Access control models and technologies
Reasoning about Typicality in Preferential Description Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Default inheritance reasoning in hybrid KL-ONE-style logics
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Autoepistemic description logics
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
The complexity of circumscription in description logic
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Deciding inseparability and conservative extensions in the description logic EL
Journal of Symbolic Computation
Defeasible inclusions in low-complexity DLs: preliminary notes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Rational closure for defeasible description logics
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
EL with default attributes and overriding
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Defeasible inheritance-based description logics
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Some of the applications of OWL and RDF (e.g. biomedical knowledge representation and semantic policy formulation) call for extensions of these languages with nonmonotonic constructs such as inheritance with overriding. Nonmonotonic description logics have been studied for many years, however no practical such knowledge representation languages exist, due to a combination of semantic difficulties and high computational complexity. Independently, low-complexity description logics such as DL-lite and EL have been introduced and incorporated in the OWL standard. Therefore, it is interesting to see whether the syntactic restrictions characterizing DL-lite and EL bring computational benefits to their nonmonotonic versions, too. In this paper we extensively investigate the computational complexity of Circumscription when knowledge bases are formulated in DL-liteR, EL, and fragments thereof. We identify fragments whose complexity ranges from P to the second level of the polynomial hierarchy, as well as fragments whose complexity raises to PSPACE and beyond.