Inproceedings2073159630: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname= Christel |ErsterAutorNachname=Baier |FurtherAuthors= Florian Funke; Jakob Piribauer; Robin Ziemek}} {{Inproceedings |Title=On probability-raising causality in Markov decision processes |Booktitle=Foundations of Software Science and Computation Structures |Editor=Bouyer, Patricia and Schröder, Lutz |Pages=40--60 |Publisher=Springer International Publishing |Year=2022 }} {{Publikation Details |…“) |
Johannes Lehmann (Diskussion | Beiträge) K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“) |
||
| Zeile 14: | Zeile 14: | ||
|Abstract=The purpose of this paper is to introduce a notion of causality in Markov decision processes based on the probability-raising principle and to analyze its algorithmic properties. The latter includes algorithms for checking causeeffect relationships and the existence of probability-raising causes for given effect scenarios. Inspired by concepts of statistical analysis, we study quality measures (recall, coverage ratio and f-score) for causes and develop algorithms for their computation. Finally, the computational complexity for finding optimal causes with respect to these measures is analyzed. | |Abstract=The purpose of this paper is to introduce a notion of causality in Markov decision processes based on the probability-raising principle and to analyze its algorithmic properties. The latter includes algorithms for checking causeeffect relationships and the existence of probability-raising causes for given effect scenarios. Inspired by concepts of statistical analysis, we study quality measures (recall, coverage ratio and f-score) for causes and develop algorithms for their computation. Finally, the computational complexity for finding optimal causes with respect to these measures is analyzed. | ||
|DOI Name=10.1007/978-3-030-99253-8_3 | |DOI Name=10.1007/978-3-030-99253-8_3 | ||
|Forschungsgruppe= | |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik | ||
}} | }} | ||
Aktuelle Version vom 5. März 2025, 14:45 Uhr
On probability-raising causality in Markov decision processes
Christel BaierChristel Baier, Florian FunkeFlorian Funke, Jakob PiribauerJakob Piribauer, Robin ZiemekRobin Ziemek
Christel Baier, Florian Funke, Jakob Piribauer, Robin Ziemek
On probability-raising causality in Markov decision processes
In Bouyer, Patricia and Schröder, Lutz, eds., Foundations of Software Science and Computation Structures, 40--60, 2022. Springer International Publishing
On probability-raising causality in Markov decision processes
In Bouyer, Patricia and Schröder, Lutz, eds., Foundations of Software Science and Computation Structures, 40--60, 2022. Springer International Publishing
- KurzfassungAbstract
The purpose of this paper is to introduce a notion of causality in Markov decision processes based on the probability-raising principle and to analyze its algorithmic properties. The latter includes algorithms for checking causeeffect relationships and the existence of probability-raising causes for given effect scenarios. Inspired by concepts of statistical analysis, we study quality measures (recall, coverage ratio and f-score) for causes and develop algorithms for their computation. Finally, the computational complexity for finding optimal causes with respect to these measures is analyzed. - Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@inproceedings{BFPZ2022,
author = {Christel Baier and Florian Funke and Jakob Piribauer and Robin
Ziemek},
title = {On probability-raising causality in Markov decision processes},
editor = {Bouyer and Patricia and Schr{\"{o}}der and Lutz},
booktitle = {Foundations of Software Science and Computation Structures},
publisher = {Springer International Publishing},
year = {2022},
pages = {40--60},
doi = {10.1007/978-3-030-99253-8_3}
}
