Description logic TBoxes: model-theoretic characterizations and rewritability

Authors:
Carsten Lutz;Robert Piro;Frank Wolter
Affiliations:
Fachbereich Informatik, Universität Bremen, Germany;Department of Computer Science, University of Liverpool, UK;Department of Computer Science, University of Liverpool, UK
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 8
Cited 1

On the relative expressiveness of description logics and predicate logics

Artificial Intelligence
On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus

Fundamenta Informaticae
The Description Logic Handbook

The Description Logic Handbook
Approximate OWL-Reasoning with Screech

RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
DL-Lite: tractable description logics for ontologies

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Expressiveness of concept expressions in first-order description logics

Artificial Intelligence
The DL-lite family and relations

Journal of Artificial Intelligence Research
Expressive approximations in DL-lite ontologies

AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications

Model-theoretic inseparability and modularity of description logic ontologies

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We characterize the expressive power of description logic (DL) TBoxes, both for expressive DLs such as ALC and ALCQIO and lightweight DLs such as DL-Lite and EL. Our characterizations are relative to first-order logic, based on a wide range of semantic notions such as bisimulation, equisimulation, disjoint union, and direct product. We exemplify the use of the characterizations by a first study of the following novel family of decision problems: given a TBox T formulated in a DL L, decide whether T can be equivalently rewritten as a TBox in the fragment L′ of L.