• Corpus ID: 14791560

Direct computation of diagnoses for ontology debugging

@article{Shchekotykhin2012DirectCO,
  title={Direct computation of diagnoses for ontology debugging},
  author={Kostyantyn M. Shchekotykhin and Philipp Fleiss and Patrick Rodler and Gerhard Friedrich},
  journal={ArXiv},
  year={2012},
  volume={abs/1209.0997}
}
Modern ontology debugging methods allow efficient identification and localization of faulty axioms defined by a user while developing an ontology. The ontology development process in this case is characterized by rather frequent and regular calls to a reasoner resulting in an early user awareness of modeling errors. In such a scenario an ontology usually includes only a small number of conflict sets, i.e. sets of axioms preserving the faults. This property allows efficient use of standard model… 
On Direct Debugging of Aligned Ontologies
TLDR
This paper presents a debugging approach based on a direct computation of diagnoses that omits calculation of conflict sets that is able to identify diagnoses for an ontology which includes a large number of faults and for which application of standard diagnosis methods fails.
Exploring duality on ontology debugging
TLDR
It is proved that it is meaningful to explore duality on ontology debugging, as it really boosts the efficiency when applied to complex ontologies compared to the previous methods.
The Justificatory Structure of OWL Ontologies
TLDR
A model for measuring user effort in the debugging process and proposed debugging strategies that exploit the justificatory structure of OWL ontologies in order to reduce user effort are introduced.
A Theory of Interactive Debugging of Knowledge Bases in Monotonic Logics
TLDR
This work proposes complete, sound and optimal methods for the interactive debugging of KBs that suggest the one (minimally invasive) error correction of the faulty KB that yields a repaired KB with exactly the intended semantics.
Interactive Debugging of Knowledge Bases
TLDR
This work proposes complete, sound and optimal methods for the interactive debugging of KBs that suggest the one (minimally invasive) error correction of the faulty KB that yields a repaired KB with exactly the intended semantics.

References

SHOWING 1-10 OF 18 REFERENCES
Interactive ontology debugging: Two query strategies for efficient fault localization☆
TLDR
This paper demonstrates how the target diagnosis can be identified by performing a sequence of observations, that is, by querying an oracle about entailments of the target ontology by identifying the best query selection strategies.
A General Diagnosis Method for Ontologies
TLDR
This paper defines general concepts for the diagnosis of ontologies and provides correct and complete algorithms for the computation of minimal diagnoses of knowledge bases.
An Efficient Method for Computing Alignment Diagnoses
TLDR
It is argued that computing a local optimal diagnosis is a reasonable choice for resolving alignment incoherence and suggested an efficient algorithm that partially exploits incomplete reasoning techniques to increase runtime performance.
Interactive ontology revision
TLDR
This paper provides theoretical foundations, heuristics, optimization strategies and comprehensive experimental results for the approach to efficient reasoning-supported interactive ontology revision, and introduces and elaborate on the notions of revision states and revision closure as formal foundations of the method.
LogMap: Logic-Based and Scalable Ontology Matching
TLDR
This paper presents LogMap--a highly scalable ontology matching system with 'built-in' reasoning and diagnosis capabilities, and is the only matching system that can deal with semantically rich ontologies containing tens (and even hundreds of thousands of classes).
ORE - A Tool for Repairing and Enriching Knowledge Bases
TLDR
ORE supports the detection of a variety of ontology modelling problems and guides the user through the process of resolving them and allows to extend an ontology through (semi-)automatic supervised learning.
Finding All Justifications of OWL DL Entailments
TLDR
This paper presents several algorithms for computing all the justifications of an entailment in an OWL-DL Ontology and shows, by an empirical evaluation, that even a reasoner independent approach works well on real ontologies.
Repairing Unsatisfiable Concepts in OWL Ontologies
TLDR
This paper investigates the problem of repairing unsatisfiable concepts in an OWL ontology in detail, keeping in mind the user perspective as much as possible and presents a preliminary version of an interactive ontology repair tool.
Hypertableau Reasoning for Description Logics
TLDR
This work presents a novel reasoning calculus for the description logic SHOIQ+--a knowledge representation formalism with applications in areas such as the SemanticWeb and shows significant performance improvements over state-of-the-art reasoners on several well-known ontologies.
Laconic and Precise Justifications in OWL
TLDR
An algorithm is provided and results from an empirical evaluation carried out on several published ontologies are presented, showing that laconic/precise justifications can be computed in a reasonable time for entailments in a range of ontologies that vary in size and complexity.
...
1
2
...