Elimination of Redundancy in Ontologies

Grimm, Stephan; Wissmann, Jens

doi:10.1007/978-3-642-21034-1_18

Cited by 25 publications

(21 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This could enable the identification and the removal of redundant constraints in other domains, such as CSP [12,10,9], SMT [35], and Ontologies [19]. This is the subject of future work.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

On Computing Minimal Equivalent Subformulas

Belov

Janota

Lynce

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A propositional formula in Conjunctive Normal Form (CNF) may contain redundant clauses -clauses whose removal from the formula does not affect the set of its models. Identification of redundant clauses is important because redundancy often leads to unnecessary computation, wasted storage, and may obscure the structure of the problem. A formula obtained by the removal of all redundant clauses from a given CNF formula F is called a Minimal Equivalent Subformula (MES) of F. This paper proposes a number of efficient algorithms and optimization techniques for the computation of MESes. Previous work on MES computation proposes a simple algorithm based on iterative application of the definition of a redundant clause, similar to the well-known deletionbased approach for the computation of Minimal Unsatisfiable Subformulas (MUSes). This paper observes that, in fact, most of the existing algorithms for the computation of MUSes can be adapted to the computation of MESes. However, some of the optimization techniques that are crucial for the performance of the state-of-the-art MUS extractors cannot be applied in the context of MES computation, and thus the resulting algorithms are often not efficient in practice. To address the problem of efficient computation of MESes, the paper develops a new class of algorithms that are based on the iterative analysis of subsets of clauses. The experimental results, obtained on representative problem instances, confirm the effectiveness of the proposed algorithms. The experimental results also reveal that many CNF instances obtained from the practical applications of SAT exhibit a large degree of redundancy.

show abstract

“…This could enable the identification and the removal of redundant constraints in other domains, such as CSP [12,10,9], SMT [35], and Ontologies [19]. This is the subject of future work.…”

Section: Discussionmentioning

confidence: 99%

“…Besides propositional logic formulas, the problem of the identification of redundant constraints is relevant in other domains. Concrete examples include Constraint Satisfaction Problems (CSP) [12,10,9], Satisfiability Modulo Theories (SMT) [35], and Ontologies [19].…”

Section: Introductionmentioning

confidence: 99%

On Computing Minimal Equivalent Subformulas

Belov

Janota

Lynce

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Cimino has developed a method to identify multiple synonymous concepts and applied it to the 2001 UMLS Metathesaurus [2]. Grimm and Wissmann [8] provide methods to compute irredundant ontologies, and Entendre [6] makes users aware of redundancies.…”

Section: Related and Future Workmentioning

confidence: 99%

“…Some of this confusion arises because of uncertainty about which roles and values are inherited from supertypes" [13]. And even though redundancies are harmless from a logical point of view, they impede the maintainability of a terminology [11], [8], as they misleadingly suggest that new information has been added to a concept, while in reality, this "new" information is more general than or equivalent to information that already has been stated in the definition of the same concept or a superconcept. In this paper, we make an inventory of redundant elements in SNOMED CT concept definitions.…”

Section: Introductionmentioning

confidence: 99%

Redundant Elements in SNOMED CT Concept Definitions

Dentler

Cornet

2013

Artificial Intelligence in Medicine

View full text Add to dashboard Cite

Abstract. While redundant elements in SNOMED CT concept definitions are harmless from a logical point of view, they unnecessarily make concept definitions of typically large ontologies such as SNOMED CT hard to construct and to maintain. In this paper, we apply a fully automated method to detect intra-axiom redundancies in SNOMED CT. We systematically analyse the completeness and soundness of the results of our method by examining the identified redundant elements. In absence of a gold standard, we check whether our method identifies concepts that are likely to contain redundant elements because they become equivalent to their stated subsumer when they are replaced by a fully defined concept with the same definition. To evaluate soundness, we remove all identified redundancies, and test whether the logical closure is preserved by comparing the concept hierarchy to the one of the official SNOMED CT distribution. We found that 35,010 of the 296,433 SNOMED CT concepts (12%) contain redundant elements in their definitions, and that the results of our method are sound and complete with respect to our partial evaluation. We recommend to free the stated form from these redundancies. In future, knowledge modellers should be supported by being pointed to newly introduced redundancies.

show abstract

“…These rules state that if the ontology contains certain statements, certain new statements should be added to the ontology. We call these added statements redundant and assume that redundant statements have been removed from the ontology [5]. RDFS rules are strictly positive.…”

Section: Ontologiesmentioning

confidence: 99%

Watermarking for Ontologies

Suchanek

Gross-Amblard

Abiteboul

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we study watermarking methods to prove the ownership of an ontology. Different from existing approaches, we propose to watermark not by altering existing statements, but by removing them. Thereby, our approach does not introduce false statements into the ontology. We show how ownership of ontologies can be established with provably tight probability bounds, even if only parts of the ontology are being re-used. We finally demonstrate the viability of our approach on real-world ontologies.

show abstract

Elimination of Redundancy in Ontologies

Cited by 25 publications

References 10 publications

On Computing Minimal Equivalent Subformulas

On Computing Minimal Equivalent Subformulas

Redundant Elements in SNOMED CT Concept Definitions

Watermarking for Ontologies

Contact Info

Product

Resources

About