A theory of diagnosis from first principles
Artificial Intelligence
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Description Logic Handbook
The Description Logic Handbook
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
Laconic and Precise Justifications in OWL
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Extracting Modules from Ontologies: A Logic-Based Approach
Modular Ontologies
Prime implicate normal form for ALC concepts
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Finding all justifications of OWL DL entailments
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Winnowing ontologies based on application use
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
On computing minimal equivalent subformulas
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
On definability and redundancy in EL–TBoxes
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Extracting justifications from bioportal ontologies
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part II
| Hi-index | 0.00 |
Ontologies may contain redundancy in terms of axioms that logically follow from other axioms and that could be removed for the sake of consolidation and conciseness without changing the overall meaning. In this paper, we investigate methods for removing such redundancy from ontologies. We define notions around redundancy and discuss typical cases of redundancy and their relation to ontology engineering and evolution. We provide methods to compute irredundant ontologies both indirectly by calculating justifications, and directly by utilising a hitting set tree algorithm and module extraction techniques for optimization. Moreover, we report on experimental results on removing redundancy from existing ontologies available on the Web.