English

A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic

Logic in Computer Science 2019-06-05 v2

Abstract

The fuzzy modality `probably` is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is non-expansive wrt. a suitable notion of behavioural distance. In the present paper, we provide a characterization of the expressive power of this logic based on this observation: We prove a probabilistic analogue of the classical van Benthem theorem, which states that modal logic is precisely the bisimulation-invariant fragment of first-order logic. Specifically, we show that every formula in probabilistic fuzzy first-order logic that is non-expansive wrt. behavioural distance can be approximated by concepts of bounded rank in probabilistic fuzzy description logic. For a modal logic perspective on the same result, see arXiv:1810.04722.

Keywords

Cite

@article{arxiv.1906.00784,
  title  = {A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic},
  author = {Paul Wild and Lutz Schröder and Dirk Pattinson and Barbara König},
  journal= {arXiv preprint arXiv:1906.00784},
  year   = {2019}
}

Comments

arXiv admin note: text overlap with arXiv:1810.04722

R2 v1 2026-06-23T09:38:54.710Z