Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910162645680128 |
|---|---|
| author | Kozhemiachenko, Daniil Sedlár, Igor |
| author_facet | Kozhemiachenko, Daniil Sedlár, Igor |
| contents | We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expressed via modal formulas, e.g., "after doing $a$, the probability of $A$ knowing that $p$ holds increases / decreases / is equal to $0.25$", "according to $A$, $p$ is equally likely to happen after doing $a$ or $b$", etc. We define the semantics of the logic on Kripke frames equipped with probability measures. We analyse the complexity of deciding the satisfiability of formulas of our logic over finitely branching models, for the full language and its fragments of varying expressivity. In particular, we identify several fragments of our logic where satisfiability is decidable in polynomial time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_22459 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic Kozhemiachenko, Daniil Sedlár, Igor Logic in Computer Science We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expressed via modal formulas, e.g., "after doing $a$, the probability of $A$ knowing that $p$ holds increases / decreases / is equal to $0.25$", "according to $A$, $p$ is equally likely to happen after doing $a$ or $b$", etc. We define the semantics of the logic on Kripke frames equipped with probability measures. We analyse the complexity of deciding the satisfiability of formulas of our logic over finitely branching models, for the full language and its fragments of varying expressivity. In particular, we identify several fragments of our logic where satisfiability is decidable in polynomial time. |
| title | Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2604.22459 |