The complexity of finite model reasoning in description logics

Authors:
Carsten Lutz;Ulrike Sattler;Lidia Tendera
Affiliations:
Institute for Theoretical Computer Science, TU Dresden, Germany;Department of Computer Science, University of Manchester, UK;Institute of Mathematics and Informatics, Opole University, Poland
Venue:
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Year:
2005

Citing 19
Cited 3

Theory of linear and integer programming

Theory of linear and integer programming
Polynomial-time implication problems for unary inclusion dependencies

Journal of the ACM (JACM)
On the satisfiability of dependency constraints in entity-relationship schemata

Information Systems
Attributive concept descriptions with complements

Artificial Intelligence
Making object-oriented schemas more expressive

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of query containment under constraints

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Description logics for conceptual data modeling

Logics for databases and information systems
On the complexity of integer programming

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

SIAM Journal on Computing
On the Interaction Between ISA and Cardinality Constraints

Proceedings of the Tenth International Conference on Data Engineering
Two-Way Alternating Automata and Finite Models

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Fundamentals of Cardinality Constraints

ER '92 Proceedings of the 11th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
RACER System Description

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Reviewing the design of DAML+OIL: an ontology language for the semantic web

Eighteenth national conference on Artificial intelligence
Complexity of Two-Variable Logic with Counting

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Two-variable logic with counting is decidable

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
How to decide query containment under constraints using a description logic

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning

Bridging the gap between OWL and relational databases

Proceedings of the 16th international conference on World Wide Web
Bridging the gap between OWL and relational databases

Web Semantics: Science, Services and Agents on the World Wide Web
Finite satisfiability of class diagrams: practical occurrence and scalability of the FiniteSat algorithm

Proceedings of the 6th International Workshop on Model-Driven Engineering, Verification and Validation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyse the complexity of finite model reasoning in the description logic ALCQI, i.e., ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are EXPTIME-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.