The classical approach for repairing a Description Logic ontology O in the sense of removing an unwanted consequence α is to delete a minimal number of axioms from O such that the resulting ontology O´ does not have the consequence α. However, the complete deletion of axioms may be too rough, in the sense that it may also remove consequences that are actually wanted. To alleviate this problem, we propose a more gentle way of repair in which axioms are not necessarily deleted, but only weakened. On the one hand, we investigate general properties of this gentle repair method. On the other hand, we propose and analyze concrete approaches for weakening axioms expressed in the Description Logic EL
The development and maintenance of large and complex ontologies are often time-consuming and error-p...
A Description Logic (DL) ontology is constituted by two components, a TBox that expresses general kn...
Abstract. In this paper we present methods to generate a Description Logic (DL) theory from a given ...
Ontology engineering is a hard and error-prone task, in which small changes may lead to errors, or e...
Ontologies based on Description Logics may contain errors, which are usually detected when reasoning...
Ontology engineering is a hard and error-prone task, in which small changes may lead to er...
Axiom weakening is a technique that allows for a fine-grained repair of inconsistent ontologies. Its...
Axiom weakening is a technique that allows for a fine-grained repair of inconsistent ontologies. Its...
Reasoners can be used to derive implicit consequences from an ontology. Sometimes unwanted consequen...
The application of automated reasoning approaches to Description Logic (DL) ontologies may produce c...
Description logics belong to a family of knowledge representation formalisms that are widely used fo...
In computer science, ontologies are dynamic entities: to adapt them to new and evolving applications...
Abstract. In recent years, there has been significant progress in devel-oping tools for debugging an...
Abstract. We extend the description logic ¢¤£¦¥¦§©¨��� � with a preference order on the axioms. With...
In computer science, ontologies are dynamic entities: to adapt them to new and evolving applications...
The development and maintenance of large and complex ontologies are often time-consuming and error-p...
A Description Logic (DL) ontology is constituted by two components, a TBox that expresses general kn...
Abstract. In this paper we present methods to generate a Description Logic (DL) theory from a given ...
Ontology engineering is a hard and error-prone task, in which small changes may lead to errors, or e...
Ontologies based on Description Logics may contain errors, which are usually detected when reasoning...
Ontology engineering is a hard and error-prone task, in which small changes may lead to er...
Axiom weakening is a technique that allows for a fine-grained repair of inconsistent ontologies. Its...
Axiom weakening is a technique that allows for a fine-grained repair of inconsistent ontologies. Its...
Reasoners can be used to derive implicit consequences from an ontology. Sometimes unwanted consequen...
The application of automated reasoning approaches to Description Logic (DL) ontologies may produce c...
Description logics belong to a family of knowledge representation formalisms that are widely used fo...
In computer science, ontologies are dynamic entities: to adapt them to new and evolving applications...
Abstract. In recent years, there has been significant progress in devel-oping tools for debugging an...
Abstract. We extend the description logic ¢¤£¦¥¦§©¨��� � with a preference order on the axioms. With...
In computer science, ontologies are dynamic entities: to adapt them to new and evolving applications...
The development and maintenance of large and complex ontologies are often time-consuming and error-p...
A Description Logic (DL) ontology is constituted by two components, a TBox that expresses general kn...
Abstract. In this paper we present methods to generate a Description Logic (DL) theory from a given ...