Deciding expressive description logics in the framework of resolution

Authors:
Ullrich Hustadt;Boris Motik;Ulrike Sattler
Affiliations:
Department of Computer Science, University of Liverpool, Liverpool, UK;Computing Laboratory, University of Oxford, Oxford, UK;School of Computer Science, University of Manchester, Manchester, UK
Venue:
Information and Computation
Year:
2008

Citing 22
Cited 7

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Theorem proving with ordering and equality constrained clauses

Journal of Symbolic Computation
On the efficiency of subsumption algorithms

Journal of the ACM (JACM)
Basic paramodulation

Information and Computation
Term rewriting and all that

Term rewriting and all that
Ordered chaining calculi for first-order theories of transitive relations

Journal of the ACM (JACM)
The entity-relationship model—toward a unified view of data

ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Resolution Strategies as Decision Procedures

Journal of the ACM (JACM)
Complexity Results for First-Order Two-Variable Logic with Counting

SIAM Journal on Computing
EXPTIME tableaux for ALC

Artificial Intelligence
Resolution Methods for the Decision Problem

Resolution Methods for the Decision Problem
A Resolution Decision Procedure for the Guarded Fragment

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A Resolution Decision Procedure for Fluted Logic

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
RACER System Description

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Combining superposition, sorts and splitting

Handbook of automated reasoning
Two-variable logic with counting is decidable

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
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

The Description Logic Handbook
A correspondence theory for terminological logics: preliminary report

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Splitting without backtracking

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A comparison of reasoning techniques for querying large description logic ABoxes

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Incremental Classification of Description Logics Ontologies

Journal of Automated Reasoning
Logic programming languages for databases and the web

A 25-year perspective on logic programming
A Prolog-based Query Language for OWL

Electronic Notes in Theoretical Computer Science (ENTCS)
A Prolog library for OWL RL

Proceedings of the 4th International Workshop on Logic in Databases
Repairing ontologies for incomplete reasoners

ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
A practical automata-based technique for reasoning in expressive description logics

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Consequence-based reasoning beyond horn ontologies

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To derive our algorithm, we extend basic superposition with a decomposition inference rule, which transforms conclusions of certain inferences into equivalent, but simpler clauses. This rule can be used for general first-order theorem proving with any resolution-based calculus compatible with the standard notion of redundancy.