Parameterized Complexity Results for a Model of Theory of Mind Based on Dynamic Epistemic Logic

In this paper we introduce a computational-level model of theory of mind (ToM) based on dynamic epistemic logic (DEL), and we analyze its computational complexity. The model is a special case of DEL model checking. We provide a parameterized complexity analysis, considering several aspects of DEL (e.g., number of agents, size of preconditions, etc.) as parameters. We show that model checking for DEL is PSPACE-hard, also when restricted to single-pointed models and S5 relations, thereby solving an open problem in the literature. Our approach is aimed at formalizing current intractability claims in the cognitive science literature regarding computational models of ToM.

[1]  Minna Lyons,et al.  Mind-reading and manipulation — Is Machiavellianism related to theory of mind? , 2010 .

[2]  Jakub Szymanik,et al.  Exploring the tractability border in epistemic tasks , 2012, Synthese.

[3]  Thomas Bolander,et al.  Epistemic planning for single- and multi-agent systems , 2011, J. Appl. Non Class. Logics.

[4]  Jörg Flum,et al.  Describing parameterized complexity classes , 2002, Inf. Comput..

[5]  James Stiller,et al.  Perspective-taking and memory capacity predict social network size , 2007, Soc. Networks.

[6]  R. Verbrugge The Facts Matter, and so do Computational Models , 2009 .

[7]  D. Premack,et al.  Does the chimpanzee have a theory of mind? , 1978, Behavioral and Brain Sciences.

[8]  Kensy Cooperrider Roots of human sociality: culture, cognition and interaction , 2009 .

[9]  Nina Gierasimczuk,et al.  A note on a generalization of the Muddy Children puzzle , 2011, TARK XIII.

[10]  Johan van Benthem Logical Dynamics of Information and Interaction: Preface , 2011 .

[11]  Iris van Rooij,et al.  Intractability and the use of heuristics in psychological explanations , 2012, Synthese.

[12]  S. Levinson On the Human "Interaction Engine" , 2020, Roots of Human Sociality.

[13]  Willem F. G. Haselager,et al.  Cognitive Science and Folk Psychology: The Right Frame of Mind , 1997 .

[14]  François Schwarzentruber,et al.  On the Complexity of Dynamic Epistemic Logic , 2013, TARK.

[15]  Rineke Verbrugge,et al.  Children’s Application of Theory of Mind in Reasoning and Language , 2008, J. Log. Lang. Inf..

[16]  S. Baron-Cohen,et al.  Does the autistic child have a “theory of mind” ? , 1985, Cognition.

[17]  John K. Tsotsos Analyzing vision at the complexity level , 1990, Behavioral and Brain Sciences.

[18]  H. Wellman,et al.  Meta-analysis of theory-of-mind development: the truth about false belief. , 2001, Child development.

[19]  Jelle Gerbrandy,et al.  Dynamic epistemic logic , 1998 .

[20]  H. Barlow Vision: A computational investigation into the human representation and processing of visual information: David Marr. San Francisco: W. H. Freeman, 1982. pp. xvi + 397 , 1983 .

[21]  A. Perea Epistemic Game Theory: Reasoning and Choice , 2012 .

[22]  U. Frith Mind Blindness and the Brain in Autism , 2001, Neuron.

[23]  W. Hoek,et al.  Dynamic Epistemic Logic , 2007 .

[24]  Gerd Gigerenzer,et al.  Why Heuristics Work , 2008, Perspectives on psychological science : a journal of the Association for Psychological Science.

[25]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[26]  Iris van Rooij,et al.  Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities , 2008, Comput. J..

[27]  M. Tomasello,et al.  Does the chimpanzee have a theory of mind? 30 years later , 2008, Trends in Cognitive Sciences.

[28]  Torben Braüner,et al.  Hybrid-Logical Reasoning in False-Belief Tasks , 2013, TARK.

[29]  Iris van Rooij,et al.  The Tractable Cognition Thesis , 2008, Cogn. Sci..

[30]  Lawrence S. Moss,et al.  The Logic of Public Announcements and Common Knowledge and Private Suspicions , 1998, TARK.

[31]  I. Apperly Mindreaders: The Cognitive Basis of "Theory of Mind" , 2010 .

[32]  Robin I. M. Dunbar,et al.  Theory-of-mind deficits and causal attributions , 1998 .

[33]  Rineke Verbrugge,et al.  Logic and Social Cognition , 2009, J. Philos. Log..

[34]  H. Wimmer,et al.  Beliefs about beliefs: Representation and constraining function of wrong beliefs in young children's understanding of deception , 1983, Cognition.

[35]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[36]  François Schwarzentruber,et al.  Complexity Results in Epistemic Planning , 2015, IJCAI.

[37]  Tadeusz W. Zawidzki,et al.  Mindshaping: A New Framework for Understanding Human Social Cognition , 2013 .

[38]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[39]  Thomas Bolander,et al.  Seeing is Believing: Formalising False-Belief Tasks in Dynamic Epistemic Logic , 2014, ECSI.

[40]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[41]  Patricia A. Evans,et al.  Identifying Sources of Intractability in Cognitive Models: An Illustration Using Analogical Structure Mapping , 2008 .

[42]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[43]  Marcello Frixione,et al.  Tractable Competence , 2001, Minds and Machines.

[44]  Patrick Blackburn,et al.  Modal logic: a semantic perspective , 2007, Handbook of Modal Logic.

[45]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[46]  Guillaume Aucher,et al.  An Internal Version of Epistemic Logic , 2010, Stud Logica.

[47]  Rineke Verbrugge,et al.  Logic and Complexity in Cognitive Science , 2014, Johan van Benthem on Logic and Information Dynamics.

[48]  J. Tenenbaum,et al.  Special issue on “Probabilistic models of cognition , 2022 .

[49]  Christopher Cherniak,et al.  Minimal Rationality , 1986, Computational models of cognition and perception.

[50]  Wayne Christensen,et al.  Ian Apperly, Mindreaders: the cognitive basis of theory of mind , 2013 .

[51]  S. Stich,et al.  Mindreading: An Integrated Account of Pretence, Self-Awareness, and Understanding Other Minds , 2003 .

[52]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[53]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[54]  Johan Kwisthout,et al.  Rational analysis, intractability, and the prospects of ‘as if’-explanations , 2014, Synthese.

[55]  Michael R. Fellows,et al.  On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..