Parameterized complexity of theory of mind reasoning in dynamic epistemic logic

DOI10.1007/s10849-018-9268-4OpenAlexW2804343002WikidataQ92909309 ScholiaQ92909309MaRDI QIDQ1711514

Iris van Rooij, Jakub Szymanik, Iris van de Pol

Publication date: 18 January 2019

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-018-9268-4

zbMATH Keywords

intractabilityparameterized complexitydynamic epistemic logictheory of mindhigher-order reasoningcomputational-level analysis

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantifiers and cognition: logical and computational perspectives
• Fundamentals of parameterized complexity
• Exploring the tractability border in epistemic tasks
• Logic and social cognition. The facts matter, and so do computational models
• Dynamic epistemic logic
• An internal version of epistemic logic
• On the parameterized complexity of multiple-interval graph problems
• Children's application of theory of mind in reasoning and language
• A logic for default reasoning
• The computational complexity of propositional STRIPS planning
• Describing parameterized complexity classes
• Hybrid-logical reasoning in the Smarties and Sally-Anne tasks
• A computational-level explanation of the speed of goal inference
• Intractability and approximation of optimization theories of cognition
• Sources of complexity in subset choice
• Parametrized complexity theory.
• The traveling salesman problem with few inner points
• Epistemic planning for single- and multi-agent systems
• Single-Player and Two-Player Buttons & Scissors Games
• The Logic of Public Announcements, Common Knowledge, and Private Suspicions
• Logical Dynamics of Information and Interaction
• Invariance Properties of Quantifiers and Multiagent Information Exchange
• Reducibility among Combinatorial Problems
• Logic and Complexity in Cognitive Science
• Computational Complexity
• The complexity of theorem-proving procedures