{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T19:17:19Z","timestamp":1792264639972,"version":"4.4.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>This work introduces a novel cause-effect relation in Markov decision\nprocesses using the probability-raising principle. Initially, sets of states as\ncauses and effects are considered, which is subsequently extended to regular\npath properties as effects and then as causes. The paper lays the mathematical\nfoundations and analyzes the algorithmic properties of these cause-effect\nrelations. This includes algorithms for checking cause conditions given an\neffect and deciding the existence of probability-raising causes. As the\ndefinition allows for sub-optimal coverage properties, quality measures for\ncauses inspired by concepts of statistical analysis are studied. These include\nrecall, coverage ratio and f-score. The computational complexity for finding\noptimal causes with respect to these measures is analyzed.<\/jats:p>","DOI":"10.46298\/lmcs-20(1:4)2024","type":"journal-article","created":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T19:20:07Z","timestamp":1705692007000},"source":"Crossref","is-referenced-by-count":2,"title":["Foundations of probability-raising causality in Markov decision processes"],"prefix":"10.46298","volume":"Volume 20, Issue 1","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakob","family":"Piribauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robin","family":"Ziemek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2024,1,19]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/12897\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/12897\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T19:20:07Z","timestamp":1705692007000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,19]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(1:4)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2209.02973v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2209.02973v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2209.02973v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2209.02973","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2209.02973","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,19]]},"article-number":"10015"}}