A four-valued semantics for terminological logics
Artificial Intelligence
A Sequent Calculus for Reasoning in Four-Valued Description Logics
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Algorithms for Paraconsistent Reasoning with OWL
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Measuring Inconsistency for Description Logics Based on Paraconsistent Semantics
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
RaDON -- Repair and Diagnosis in Ontology Networks
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Complexity boundaries for horn description logics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Reasoning with inconsistent ontologies
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Foundations of Semantic Web Technologies
Foundations of Semantic Web Technologies
Handbook on Ontologies
A framework for handling inconsistency in changing ontologies
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Inferring with inconsistent OWL DL ontology: a multi-valued logic approach
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
GeoS '09 Proceedings of the 3rd International Conference on GeoSpatial Semantics
Paraconsistent and approximate semantics for the OWL 2 web ontology language
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Three-valued paraconsistent reasoning for semantic web agents
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
Inconsistency-tolerant semantics for description logics
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Extending paraconsistent SROIQ
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Scalable OWL 2 reasoning for linked data
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Query rewriting for inconsistent DL-lite ontologies
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Paraconsistent reasoning for semantic web agents
Transactions on Compuational Collective Intelligence VI
Paraconsistent query answering over DL-Lite ontologies
Web Intelligence and Agent Systems
Hi-index | 0.00 |
A four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases. This approach has a distinct advantage that it can be implemented by invoking classical reasoners to keep the same complexity as under the classical semantics. However, this approach has so far only been studied for the basic description logic $\mathcal{ALC}$. In this paper, we further study how to extend the four-valued semantics to the more expressive description logic $\mathcal{SROIQ}$ which underlies the forthcoming revision of the Web Ontology Language, OWL 2, and also investigate how it fares when adapted to tractable description logics including $\mathcal{EL++}$, DL-Lite, and Horn-DLs. We define the four-valued semantics along the same lines as for $\mathcal{ALC}$ and show that we can retain most of the desired properties.