Abstract
This paper motivates the study of counterpossibles (logically impossible counterfactuals) as necessary for developing a decision theory suitable for generally intelligent agents embedded within their environments. We discuss two attempts to formalize a decision theory using counterpossibles, one based on graphical models and another based on proof search.
Author supplied keywords
Cite
CITATION STYLE
Soares, N., & Fallenstein, B. (2015). Two attempts to formalize counterpossible reasoning in deterministic settings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9205, pp. 156–165). Springer Verlag. https://doi.org/10.1007/978-3-319-21365-1_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
