Model-based revision operators for terminologies in description logics

Authors:
Guilin Qi;Jianfeng Du
Affiliations:
Institute AIFB, University of Karlsruhe, Karlsruhe, Germany;Institute of Software, Chinese Academy of Sciences, Beijing, China and Graduate University of the Chinese Academy of Sciences, Beijing, China
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 14
Cited 12

The complexity of optimization problems

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Propositional knowledge base revision and minimal change

Artificial Intelligence
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Debugging Incoherent Terminologies

Journal of Automated Reasoning
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Formal Properties of Modularisation

Modular Ontologies
Inconsistencies, negations and changes in ontologies

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Knowledge integration for description logics

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
On the approximation of instance level update and erasure in description logics

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Forgetting concepts in DL-lite

ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
On applying the AGM theory to DLs and OWL

ISWC'05 Proceedings of the 4th international conference on The Semantic Web
A framework for handling inconsistency in changing ontologies

ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Knowledge base revision in description logics

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Consistent evolution of OWL ontologies

ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications

Evidential reasoning for the treatment of incoherent terminologies

Proceedings of the 2010 ACM Symposium on Applied Computing
Inconsistency-tolerant semantics for description logics

RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Evolution of DL-lite knowledge bases

ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
A tableau algorithm for paraconsistent and nonmonotonic reasoning in description logic-based system

APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Query rewriting for inconsistent DL-lite ontologies

RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Foundations of instance level updates in expressive description logics

Artificial Intelligence
Argumentation-Based reasoning with inconsistent knowledge bases

AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Towards a paradoxical description logic for the semantic web

FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
On the complexity of dealing with inconsistency in description logic ontologies

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Capturing model-based ontology evolution at the instance level: The case of DL-Lite

Journal of Computer and System Sciences
Minimal change: Relevance and recovery revisited

Artificial Intelligence
An argumentation framework for description logic ontology reasoning and management

Journal of Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of revising an ontology consistently is closely related to the problem of belief revision which has been widely discussed in the literature. Some syntax-based belief revision operators have been adapted to revise ontologies in Description Logics (DLs). However, these operators remove the whole axioms to resolve logical contradictions and thus are not fine-grained. In this paper, we propose three model-based revision operators to revise terminologies in DLs. We show that one of them is more rational than others by comparing their logical properties. Therefore, we focus on this revision operator. We also consider the problem of computing the result of revision by our operator with the help of the notion of concept forgetting. Finally, we analyze the computational complexity of our revision operator.