Computer Science – Logic in Computer Science
Scientific paper
2011-04-11
Computer Science
Logic in Computer Science
16 pages
Scientific paper
We formulate bisimulations for useful description logics. The simplest among the considered logics is a variant of PDL (propositional dynamic logic). The others extend that logic with inverse roles, nominals, quantified number restrictions, the universal role, and/or the "Self" concept constructor. They also allow role axioms. We give results about invariance of concepts, TBoxes and ABoxes, preservation of RBoxes and knowledge bases, and the Hennessy-Milner property w.r.t. bisimulations in the considered description logics. We provide also results on the largest auto-bisimulations and quotient interpretations w.r.t. such equivalence relations.
Divroodi Ali Rezaei
Nguyen Linh Anh
No associations
LandOfFree
On Bisimulations for Description Logics 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 On Bisimulations for Description Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Bisimulations for Description Logics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-58747