A computational-level explanation of the speed of goal inference

DOI10.1016/j.jmp.2013.05.006zbMath1284.91499MaRDI QIDQ2437256

Mark Blokpoel, Todd Wareham, Johan Kwisthout, 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 complexity; NP-hard; abduction; intractability; fixed-parameter tractability; goal inference; inverse planning

Mathematics Subject Classification ID

91E30: Psychophysics and psychophysiology; perception

Related Items

Rational analysis, intractability, and the prospects of `as if'-explanations, Parameterized complexity of theory of mind reasoning in dynamic epistemic logic, Naturalism, tractability and the adaptive toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intractability and the use of heuristics in psychological explanations
• Most probable explanations in Bayesian networks: complexity and tractability
• The computational complexity of abduction
• Approximating MAPs for belief networks is NP-hard and other theorems
• Finding MAPs for belief networks is NP-hard
• Intractability and approximation of optimization theories of cognition
• Coherence measures and inference to the best explanation
• Goals and means in action observation: a computational approach
• Bayesian Networks and Decision Graphs
• Graph minors. II. Algorithmic aspects of tree-width