Two Attempts to Formalize Counterpossible Reasoning in Deterministic Settings

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.

• Type: Journal
• Year: 2015
• Where: AGI
• Authors: Nate Soares, Benja Fallenstein
• Keywords: AGI 2015, Artificial Intelligence