Probabilistic Epistemic Dynamic Agentive Logic
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917431713202176 |
|---|---|
| author | Logan, Shay Allen |
| author_facet | Logan, Shay Allen |
| contents | I introduce PEDAL -- a probabilistic epistemic logic meant to capture, in propositional dynamic terms, the epistemic state of an agent engaged in checking whether a program meets its specification. Semantically, PEDAL is built `on top of' PDL and uses probability measures defined on the set of possible program valuations of an otherwise-specified PDL-model. A Hilbert system with one infinitary rule is provided and proved to be sound and complete. Near the end, I discuss possible ways to circumvent infinitary proof difficulties. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_22042 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Probabilistic Epistemic Dynamic Agentive Logic Logan, Shay Allen Logic in Computer Science F.3.1; F.4.1 I introduce PEDAL -- a probabilistic epistemic logic meant to capture, in propositional dynamic terms, the epistemic state of an agent engaged in checking whether a program meets its specification. Semantically, PEDAL is built `on top of' PDL and uses probability measures defined on the set of possible program valuations of an otherwise-specified PDL-model. A Hilbert system with one infinitary rule is provided and proved to be sound and complete. Near the end, I discuss possible ways to circumvent infinitary proof difficulties. |
| title | Probabilistic Epistemic Dynamic Agentive Logic |
| topic | Logic in Computer Science F.3.1; F.4.1 |
| url | https://arxiv.org/abs/2604.22042 |