Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation
Information and Computation
Term rewriting and all that
Resolution Strategies as Decision Procedures
Journal of the ACM (JACM)
Complexity Results for First-Order Two-Variable Logic with Counting
SIAM Journal on Computing
Resolution Methods for the Decision Problem
Resolution Methods for the Decision Problem
Uniform Derivation of Decision Procedures by Superposition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A Superposition Decision Procedure for the Guarded Fragment with Equality
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Complexity of the Two-Variable Fragment with Counting Quantifiers
Journal of Logic, Language and Information
A tableaux decision procedure for SHOIQ
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hybrid Logics and Ontology Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimizing Terminological Reasoning for Expressive Description Logics
Journal of Automated Reasoning
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
Journal of Automated Reasoning
A comparison of two modelling paradigms in the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$
Journal of Automated Reasoning
A large-scale semantic grid repository
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
| Hi-index | 0.00 |
We present a resolution-based decision procedure for the description logic $\mathcal{SHOIQ}$ — the logic underlying the Semantic Web ontology language $\mathcal{OWLDL}$. Our procedure is goal-oriented, and it naturally extends a similar procedure for $\mathcal{SHIQ}$, which has proven itself in practice. Applying existing techniques for deriving saturation-based decision procedures to $\mathcal{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.