Dynamic Description Logics
Frank Wolter, Michael Zakharyaschev · BIROn (Birkbeck, University of London) · 1998
this paper can be viewed from different standpoints. A modal logician would probably say that we combine polymodal K with PDL and prove the decidability of the resulting hybrid. In the field of knowledge representation, the paper can be characterized as an attempt to introduce a dynamic dimension in concept description (alias terminological) logics. And finally, in a broader perspective, our concern is to construct and study formalisms for representing and processing knowledge in dynamic application domains that would be maximally expressive, on the one hand, and decidable, on the other. Concept description (or simply description) logics originate from practical knowledge representation systems (see e.g. [3, 8, 1]) which, in turn, can be traced back to the ideas of semantic networks and frames. An application domain is represented in the framework of a description logic by means of formulas which define complex concepts out of primitive ones and assert that certain objects belong to certain concepts or are in certain relations to some other objects. Starting, for instance, from the primitive concepts child, grandma, wealthy, warm island and the binary relations (or roles) has, lives we can define a compound concept