A computational-level explanation of the speed of goal inference
From MaRDI portal
Publication:2437256
DOI10.1016/J.JMP.2013.05.006zbMATH Open1284.91499OpenAlexW2005224827MaRDI QIDQ2437256FDOQ2437256
Mark Blokpoel, Theo P. van der Weide, Todd Wareham, Johan Kwisthout, Iris van Rooij
Publication date: 3 March 2014
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmp.2013.05.006
Recommendations
- Active inference, belief propagation, and the Bethe approximation
- Goals and means in action observation: a computational approach
- Completion of the infeasible actions of others: goal inference by dynamical invariant
- Bayesian models of brain and behaviour
- Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
computational complexityabductionfixed-parameter tractabilityNP-hardintractabilitygoal inferenceinverse planning
Cites Work
- Title not available (Why is that?)
- Bayesian Networks and Decision Graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Title not available (Why is that?)
- Finding MAPs for belief networks is NP-hard
- Title not available (Why is that?)
- Coherence measures and inference to the best explanation
- Intractability and the use of heuristics in psychological explanations
- Approximating MAPs for belief networks is NP-hard and other theorems
- Most probable explanations in Bayesian networks: complexity and tractability
- The computational complexity of abduction
- Title not available (Why is that?)
- Intractability and approximation of optimization theories of cognition
- Goals and means in action observation: a computational approach
Cited In (5)
- Goals and means in action observation: a computational approach
- Rational analysis, intractability, and the prospects of `as if'-explanations
- Naturalism, tractability and the adaptive toolbox
- Predicting goal error evolution from near-initial-information: a learning algorithm
- Parameterized complexity of theory of mind reasoning in dynamic epistemic logic
This page was built for publication: A computational-level explanation of the speed of goal inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437256)
