... | ... | @@ -25,15 +25,20 @@ The Exquisite Ontology Debugging Tab is split up into four differen views: the d |
|
|
|
|
|
![debugger](/uploads/b18b3ea12f8ee4e7e14b07676abbc080/debugger.PNG)
|
|
|
|
|
|
Please note currently when loading an ontology the debugger automatically assigns simple axioms to the list of correct axioms (also called background knowledge).
|
|
|
|
|
|
# Diagnoses
|
|
|
With this tool we can search for diagnoses. But first we have to configure which reasoner we want to use for the diagnoses search. Select *Reasoner->and a preferred reasoner*
|
|
|
Next to the overview of the diagnoses model the Exquisite Ontology Debugging Tab's main functionality is to search for diagnoses.
|
|
|
|
|
|
Before we do calculate a set of diagnoses for the loaded ontology, we first have to configure which reasoner we want to use for the diagnoses search. Therefore, select *Reasoner* and select a preferred reasoner. For this example we are using the HermiT reasoner.
|
|
|
|
|
|
#### Options for diagnoses
|
|
|
Next let us see what option we do have for the diagnoses search. Select *Exquisite Debugger->Options*
|
|
|
After selction of an appropriate reasoner, let us see what option we do have for the diagnoses search.
|
|
|
Select *Exquisite Debugger->Options*.
|
|
|
|
|
|
![options_diagnoses](/uploads/085d60225ca537dd5df02a8e543e9086/options_diagnoses.PNG)
|
|
|
![options_diagnoses](/uploads/cfcaf35eade5adf9674103113493aebe/options_diagnoses.PNG)
|
|
|
|
|
|
* As diagnoses engine we can choose between Inv-QuickXPlain (default) as well as HS-Tree and HS-DAG. The first algorithm computes diagnoses directly, i.e. without computation of minimal conflicts, and must be used if you want to find only a few diagnoses very fast. The other two algorithms are based on computation of conflicts and are preferable if you want to use the interactive version of our debugger.
|
|
|
* As diagnoses engine we can choose either between Inv-QuickXPlain, HS-Tree (default) and HS-DAG. The first algorithm computes diagnoses directly, i.e. without computation of minimal conflicts, and must be used if you want to find only a few diagnoses very fast. The other two algorithms are based on computation of conflicts and are preferable if you want to use the interactive version of our debugger.
|
|
|
* Next we can choose how many diagnoses we want to calculate at most (default is 9). Please note that the higher the number the more time is required to calculate depending on the complexity of the ontology.
|
|
|
* If you want to debug an incoherent ontology, the process quite often can be speed up by reducing the incoherency to inconsistency -- by adding a new individual to every unsatisfiable class -- and by replacing the initial ontology with a set of "star" modules. Both options are selected by default.
|
|
|
|
... | ... | |