Results 1 -
6 of
6
A resolution-based decision procedure for SHOIQ
- Proc. of the 3rd Int. Joint Conf. on Automated Reasoning (IJCAR 2006), volume 4130 of LNAI
, 2006
"... Abstract. 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 tec ..."
Abstract
-
Cited by 16 (2 self)
- Add to MetaCart
Abstract. 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. 1
Stratified Resolution
, 2001
"... We introduce a calculus of stratified resolution, in which special attention is paid to clauses that "define" relations. If such clauses are discovered in the initial set of clauses, they are treated using the rule of definition unfolding, i.e. the rule that replaces defined relations by their defin ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
We introduce a calculus of stratified resolution, in which special attention is paid to clauses that "define" relations. If such clauses are discovered in the initial set of clauses, they are treated using the rule of definition unfolding, i.e. the rule that replaces defined relations by their definitions. Stratified resolution comes with a powerful notion of redundancy: a clause to which definition unfolding has been applied can be removed from the search space. To prove the completeness of stratified resolution with redundancies, we use a novel combination of Bachmair and Ganzinger's model construction technique and a hierarchical construction of orderings and least fixpoints.
The Blossom of Finite Semantic Trees Jean Goubault-Larrecq1 ⋆ 2 ⋆ ⋆ ⋆ ⋆ ⋆
"... This paper is dedicated to the memory of Harald Ganzinger. ..."
Using Resolution as Decision Procedure
, 2005
"... Logic made a major step in 1879, when Gottlob Frege published his ’Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens’, see [26]. In this paper, which marks the start of modern logic, Frege introduced a formal language, (which he called Begriffsschrift), in which ..."
Abstract
- Add to MetaCart
Logic made a major step in 1879, when Gottlob Frege published his ’Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens’, see [26]. In this paper, which marks the start of modern logic, Frege introduced a formal language, (which he called Begriffsschrift), in which mathematical statements

