We present a resolution-based decision procedure for the description logic SHOIQ - the logic underlying the Semantic Web ontology language OWL-DL. Our procedure is goal-oriented, and it naturally extends a similar procedure for SHIQ, which has proven itself in practice. Applying existing techniques for deriving saturation-based decision procedures to SHOIQ is not straightforward due to nominals, number restrictions, and inverse roles - a combination known to cause termination problems. We overcome this difficulty by using the basic superposition calculus, extended with custom simplification rules. © Springer-Verlag Berlin Heidelberg 2006
Resolution is an important and attractive tool for rewriting a Description Logic ontology into (disj...
Abstract. Resolution-based calculi are among the most widely used calculi for theorem proving in fir...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi for solvin...
We present a resolution-based decision procedure for the description logic SHOIQ - the logic underly...
We present a resolution-based decision procedure for the description logic SHOIQ—the logic underlyin...
We present a resolution-based decision procedure for the description logic SHOIQ—the logic underlyin...
We present a resolution-based decision procedure for the description logicQ1 SHOIQ - the logic under...
This paper presents a tableaux decision procedure for SHOIQ, the DL underlying OWL DL. To the best o...
We present a decision procedure for the description logic SHIQ based on the basic superposition calc...
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent ...
We present a decision procedure for the description logic SHIQ based on the basic superposition calc...
International audienceThe Semantic Web makes an extensive use of the OWL DL ontology language, under...
International audienceThe Semantic Web makes an extensive use of the OWL DL ontology language, under...
AbstractWe present a decision procedure for the description logic SHIQ based on the basic superposit...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi to solve t...
Resolution is an important and attractive tool for rewriting a Description Logic ontology into (disj...
Abstract. Resolution-based calculi are among the most widely used calculi for theorem proving in fir...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi for solvin...
We present a resolution-based decision procedure for the description logic SHOIQ - the logic underly...
We present a resolution-based decision procedure for the description logic SHOIQ—the logic underlyin...
We present a resolution-based decision procedure for the description logic SHOIQ—the logic underlyin...
We present a resolution-based decision procedure for the description logicQ1 SHOIQ - the logic under...
This paper presents a tableaux decision procedure for SHOIQ, the DL underlying OWL DL. To the best o...
We present a decision procedure for the description logic SHIQ based on the basic superposition calc...
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent ...
We present a decision procedure for the description logic SHIQ based on the basic superposition calc...
International audienceThe Semantic Web makes an extensive use of the OWL DL ontology language, under...
International audienceThe Semantic Web makes an extensive use of the OWL DL ontology language, under...
AbstractWe present a decision procedure for the description logic SHIQ based on the basic superposit...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi to solve t...
Resolution is an important and attractive tool for rewriting a Description Logic ontology into (disj...
Abstract. Resolution-based calculi are among the most widely used calculi for theorem proving in fir...
Consequence-based (CB) reasoners combine ideas from resolution and (hyper)tableau calculi for solvin...