A computational-level explanation of the speed of goal inference

DOI10.1016/J.JMP.2013.05.006MaRDI QIDQ2437256zbMATH OpenOpenAlexFDO

Authors Mark Blokpoel, Johan Kwisthout, Todd Wareham, Iris van Rooij, Theo P. van der Weide

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

zbMATH Keywords

computational complexityabductionfixed-parameter tractabilityNP-hardintractabilitygoal inferenceinverse planning

Mathematics Subject Classification ID

Psychophysics and psychophysiology; perception (91E30)

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 1775419 (Why is no real title available?)
• scientific article; zbMATH DE number 2243356 (Why is no real title available?)
• Approximating MAPs for belief networks is NP-hard and other theorems
• Bayesian Networks and Decision Graphs
• Coherence measures and inference to the best explanation
• Finding MAPs for belief networks is NP-hard
• Goals and means in action observation: a computational approach
• Graph minors. II. Algorithmic aspects of tree-width
• Intractability and approximation of optimization theories of cognition
• Intractability and the use of heuristics in psychological explanations
• Most probable explanations in Bayesian networks: complexity and tractability
• The computational complexity of abduction

Cited in

(7)

• Rational analysis, intractability, and the prospects of `as if'-explanations
• Fictional narrative as a variational Bayesian method for estimating social dispositions in large groups
• Completion of the infeasible actions of others: goal inference by dynamical invariant
• Naturalism, tractability and the adaptive toolbox
• Goals and means in action observation: a computational approach
• 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)