A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Attributive concept descriptions with complements
Artificial Intelligence
Using resolution for extending KL-ONE-type languages
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Ordered chaining calculi for first-order theories of transitive relations
Journal of the ACM (JACM)
Resolution Strategies as Decision Procedures
Journal of the ACM (JACM)
Resolution Methods for the Decision Problem
Resolution Methods for the Decision Problem
Automated Deduction Techniques for Classification in Description Logic Systems
Journal of Automated Reasoning
Decidability by Resolution for Propositional Modal Logics
Journal of Automated Reasoning
A Resolution Decision Procedure for the Guarded Fragment
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
On evaluating decision procedures for modal logic
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Individual Reuse in Description Logic Reasoning
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
On the relation of resolution and tableaux proof systems for description logics
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Monadic Σ11 and Modal Logic with Quantified Binary Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
On applying the AGM theory to DLs and OWL
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Reasoning in description logics: basics, extensions, and relatives
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Preferential Semantics for Plausible Subsumption in Possibility Theory
Minds and Machines
Using tableau to decide description logics with full role negation and identity
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an ordering restriction and applies to the description logic ALB, which extends ALC with the top role, full role negation, role intersection, role disjunction, role converse, domain restriction, range restriction, and role hierarchies. The second method is based solely on a selection restriction and applies to reducts of ALB without the top role and role negation. The latter method can be viewed as a polynomial simulation of familiar tableaux-based decision procedures. It can also be employed for automated model generation.