From tableaux to automata for description logics

Authors:
Franz Baader;Jan Hladik;Carsten Lutz;Frank Wolter
Affiliations:
Theoretical Computer Science, TU Dresden, D-01062 Dresden, Germany;Theoretical Computer Science, TU Dresden, D-01062 Dresden, Germany;Theoretical Computer Science, TU Dresden, D-01062 Dresden, Germany;Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, U.K.
Venue:
Fundamenta Informaticae
Year:
2003

Citing 18
Cited 4

Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
Attributive concept descriptions with complements

Artificial Intelligence
K-Rep system overview

ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
The CLASSIC knowledge representation system: guiding principles and implementation rationale

ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
The BACK system—an overview

ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
EXPTIME tableaux for ALC

Artificial Intelligence
How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi

ACM Transactions on Computational Logic (TOCL)
Modal logic

Modal logic
Readings in Knowledge Representation

Readings in Knowledge Representation
The Inverse Method Implements the Automata Approach for Modal Satisfiability

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
BDD-Based Decision Procedures for K

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Basic description logics

The description logic handbook
Complexity of reasoning

The description logic handbook
Expressive description logics

The description logic handbook
Description logic systems

The description logic handbook
Implementation and optimization techniques

The description logic handbook

Automata can show PSpace results for description logics

Information and Computation
Axiom Pinpointing in General Tableaux

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Ontology Integration Using ε-Connections

Modular Ontologies
Combining OWL ontologies using E-Connections

Web Semantics: Science, Services and Agents on the World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the relationship between automata- and tableau-based inference procedures for description logics. To be more precise, we develop an abstract notion of what a tableau-based algorithm is, and then show, on this abstract level, how tableau-based algorithms can be converted into automata-based algorithms. In particular, this allows us to characterize a large class of tableau-based algorithms that imply an ExpTime upper-bound for reasoning in the description logics for which such an algorithm exists.