Computer Science – Logic in Computer Science
Scientific paper
2011-04-14
Computer Science
Logic in Computer Science
Submitted and accepted for IJCAI 2011
Scientific paper
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.
Lutz Carsten
Piro Robert
Wolter Frank
No associations
LandOfFree
Description Logic TBoxes: Model-theoretic Characterizations and Rewritability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Description Logic TBoxes: Model-theoretic Characterizations and Rewritability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Description Logic TBoxes: Model-theoretic Characterizations and Rewritability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-167365