A Characterization Theorem for a Modal Description Logic

Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5-ALC combines the standard description logic ALC with an S5-modality that can be understood as an epistemic operator or as representing (undirected) change. This logic embeds into a corresponding modal first-order logic S5-FOL. We prove a modal characterization theorem for this embedding, in analogy to results by van Benthem and Rosen relating ALC to standard first-order logic: We show that S5-ALC with only local roles is, both over finite and over unrestricted models, precisely the bisimulation invariant fragment of S5-FOL, thus giving an exact description of the expressive power of S5-ALC with only local roles.

[1]  Santiago Figueira,et al.  Model theory of XPath on data trees. Part II: Binary bisimulation and definability , 2017, Inf. Comput..

[2]  Carsten Lutz,et al.  Probabilistic Description Logics for Subjective Uncertainty , 2010, KR.

[3]  Anuj Dawar,et al.  Modal characterisation theorems over special classes of frames , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[4]  Frank Wolter,et al.  First-order Expressivity for S5-models: Modal vs. Two-sorted Languages , 2001, J. Philos. Log..

[5]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[6]  Ijcai 2007 , 2007, Künstliche Intell..

[7]  Carsten Lutz,et al.  A Description Logic of Change , 2007, Description Logics.

[8]  Maarten Marx,et al.  Multi-dimensional modal logic , 1997, Applied logic series.

[9]  David Janin,et al.  Automata for the mu-calculus and Related Results , 1995 .

[10]  Andrew G. Glen,et al.  APPL , 2001 .

[11]  Balder ten Cate,et al.  Some modal aspects of XPath , 2010, J. Appl. Non Class. Logics.

[12]  Kit Fine,et al.  Normal forms in modal logic , 1975, Notre Dame J. Formal Log..

[13]  Tadeusz Litak,et al.  A Van Benthem/Rosen theorem for coalgebraic predicate logic , 2015, J. Log. Comput..

[14]  Carsten Lutz,et al.  Temporal Description Logics: A Survey , 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.

[15]  A. G. Oettinger,et al.  Language and information , 1968 .

[16]  Helle Hvid Hansen,et al.  Neighbourhood Structures: Bisimilarity and Basic Model Theory , 2009, Log. Methods Comput. Sci..

[17]  Frank Wolter,et al.  Multi-Dimensional Description Logics , 1999, IJCAI.

[18]  Yde Venema,et al.  Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[19]  Eric Rosen,et al.  Modal Logic over Finite Structures , 1997, J. Log. Lang. Inf..

[20]  H. Gaifman On Local and Non-Local Properties , 1982 .

[21]  Julian-Steffen Müller,et al.  A Van Benthem Theorem for Modal Team Semantics , 2015, CSL.

[22]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

[23]  Facundo Carreiro,et al.  PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[24]  Frank Wolter,et al.  Modal Description Logics: Modalizing Roles , 1999, Fundam. Informaticae.

[25]  R. Lathe Phd by thesis , 1988, Nature.