2014
DOI: 10.1016/j.cogsys.2013.07.003
|View full text |Cite
|
Sign up to set email alerts
|

Reasoning about reasoning by nested conditioning: Modeling theory of mind with probabilistic programs

Abstract: A wide range of human reasoning patterns can be explained as conditioning in probabilistic models; however, conditioning has traditionally been viewed as an operation applied to such models, not represented in such models. We describe how probabilistic programs can explicitly represent conditioning as part of a model. This enables us to describe reasoning about others' reasoning using nested conditioning. Much of human reasoning is about the beliefs, desires, and intentions of other people; we use probabilisti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
23
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 29 publications
(25 citation statements)
references
References 11 publications
0
23
0
Order By: Relevance
“…Despite the claims of "theory theories" (e.g., Davies & Stone 1995), the field has made little progress beyond "common sense platitudes" (e.g., Lewis 1970) when articulating rules or principles governing the relations among mental states or between mental states and behaviour. Approaches that formalise aspects of mindreading as Bayesian inverse inferences (e.g., Jara-Ettinger et al 2016) are promising for scenarios that artificially limit the set of possible mental states that could be ascribed, but are unlikely to be extensible to more realistic scenarios (Stuhlmüller & Goodman 2014). There are good grounds for thinking "theory theories" have made limited progress because the rules or principles governing relations among mental states are uncodifiable (e.g., Davidson 1990).…”
Section: Open Peer Commentarymentioning
confidence: 99%
“…Despite the claims of "theory theories" (e.g., Davies & Stone 1995), the field has made little progress beyond "common sense platitudes" (e.g., Lewis 1970) when articulating rules or principles governing the relations among mental states or between mental states and behaviour. Approaches that formalise aspects of mindreading as Bayesian inverse inferences (e.g., Jara-Ettinger et al 2016) are promising for scenarios that artificially limit the set of possible mental states that could be ascribed, but are unlikely to be extensible to more realistic scenarios (Stuhlmüller & Goodman 2014). There are good grounds for thinking "theory theories" have made limited progress because the rules or principles governing relations among mental states are uncodifiable (e.g., Davidson 1990).…”
Section: Open Peer Commentarymentioning
confidence: 99%
“…Despite the claims of “theory theories” (e.g., Davies & Stone 1995), the field has made little progress beyond “common sense platitudes” (e.g., Lewis 1970) when articulating rules or principles governing the relations among mental states or between mental states and behaviour. Approaches that formalise aspects of mindreading as Bayesian inverse inferences (e.g., Jara-Ettinger et al 2016) are promising for scenarios that artificially limit the set of possible mental states that could be ascribed, but are unlikely to be extensible to more realistic scenarios (Stuhlmüller & Goodman 2014). There are good grounds for thinking “theory theories” have made limited progress because the rules or principles governing relations among mental states are uncodifiable (e.g., Davidson 1990).…”
Section: Mindreading Is Unlike Reading Because Mindreading Does Not Essentially Involve Decodingmentioning
confidence: 99%
“…On the other hand, if she uses a ''soft'' maximization rule in the style of Stuhlmüller and Goodman [18], sec. 3.1], she would merely be more predisposed to choose the oversampled bar.…”
Section: Aymptotic Accuracymentioning
confidence: 99%
“…In a recent article, Goodman and Stuhlmüller [18] have proposed a different approach to this problem. The system they propose is implemented in the stochastic programming language Church [10] and models probability distributions over probability distributions in terms of sampling schemes that sample other sampling schemes.…”
mentioning
confidence: 99%