The computational costs of recipient design and intention recognition in communication
暂无分享,去创建一个
Johan Kwisthout | Iris van Rooij | Todd Wareham | Mark Blokpoel | Ivan Toni | Willem F. G. Haselager
[1] Noah D. Goodman,et al. Teaching Games : Statistical Sampling Assumptions for Learning in Pedagogical Situations , 2008 .
[2] Bruno Galantucci,et al. An Experimental Study of the Emergence of Human Communication Systems , 2005, Cogn. Sci..
[3] R. Verbrugge. The Facts Matter, and so do Computational Models , 2009 .
[4] Dean Allemang,et al. The Computational Complexity of Abduction , 1991, Artif. Intell..
[5] Patricia A. Evans,et al. Identifying Sources of Intractability in Cognitive Models: An Illustration Using Analogical Structure Mapping , 2008 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] A. Darwiche,et al. Complexity Results and Approximation Strategies for MAP Explanations , 2011, J. Artif. Intell. Res..
[8] Finn V. Jensen,et al. Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.
[9] Iris van Rooij,et al. Sources of complexity in subset choice , 2005 .
[10] Iris van Rooij,et al. The Tractable Cognition Thesis , 2008, Cogn. Sci..
[11] Peter Hagoort,et al. Exploring the cognitive infrastructure of communication , 2012 .
[12] H. Wareham,et al. Similarity as tractable transformation , 2009 .
[13] Gustav Nordh,et al. Propositional Abduction is Almost Always Hard , 2005, IJCAI.
[14] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[15] Iris van Rooij,et al. Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities , 2008, Comput. J..
[16] D. Barr,et al. The Egocentric Basis of Language Use , 1998 .
[17] Johan Kwisthout,et al. Most probable explanations in Bayesian networks: Complexity and tractability , 2011, Int. J. Approx. Reason..
[18] Zoubin Ghahramani,et al. Learning Dynamic Bayesian Networks , 1997, Summer School on Neural Networks.
[19] S. Levinson. On the Human "Interaction Engine" , 2020, Roots of Human Sociality.
[20] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[21] S. Kirby,et al. Language evolution in the laboratory , 2010, Trends in Cognitive Sciences.
[22] Paul Thagard,et al. Coherence as Constraint Satisfaction , 2019, Cogn. Sci..
[23] P. Hagoort,et al. Recipient design in tacit communication , 2009, Cognition.
[24] Lance Fortnow,et al. The status of the P versus NP problem , 2009, CACM.
[25] Chris L. Baker,et al. Action understanding as inverse planning , 2009, Cognition.
[26] J. Kwisthout,et al. The Computational Complexity of Probabilistic Networks , 2009 .
[27] Todd Wareham,et al. What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective , 2011, J. Probl. Solving.
[28] R. Goldman,et al. Probabilistic Abduction for Plan Recognition , 1991 .
[29] Johan Kwisthout,et al. How Action Understanding can be Rational, Bayesian and Tractable , 2010 .
[30] Putnam,et al. The Collected Papers. , 1988 .
[31] Ashraf M. Abdelbar,et al. Approximating MAPs for Belief Networks is NP-Hard and Other Theorems , 1998, Artif. Intell..
[32] K. McRae,et al. Proceedings of the 30th Annual Conference of the Cognitive Science Society. , 2008 .
[33] A. Avramides. Studies in the Way of Words , 1992 .
[34] Peter Lipton,et al. Inference to the best explanation , 1993 .
[35] D. Sperber,et al. Relevance: Communication and Cognition , 1997 .