Parameterized complexity results for a model of theory of mind based on dynamic epistemic logic

MaRDI QIDQ5015396zbMATH OpenFDO

Authors Iris van de Pol, Iris van Rooij, Jakub Szymanik

Publication date 7 December 2021

Full work available at URL https://arxiv.org/abs/1606.07526, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TARK2015.18

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• Parameterized complexity of theory of mind reasoning in dynamic epistemic logic
• On the computational complexity of model checking for dynamic epistemic logic with S5 models
• Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
• Symbolic Model Checking for Dynamic Epistemic Logic
• Tableau method and NEXPTIME-completeness of DEL-sequents

Cites work

• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• An internal version of epistemic logic
• Children's application of theory of mind in reasoning and language
• Describing parameterized complexity classes
• Dynamic epistemic logic
• Epistemic planning for single- and multi-agent systems
• Exploring the tractability border in epistemic tasks
• Fundamentals of parameterized complexity
• Hybrid-logical reasoning in the Smarties and Sally-Anne tasks
• Intractability and the use of heuristics in psychological explanations
• Invariance Properties of Quantifiers and Multiagent Information Exchange
• Logic and complexity in cognitive science
• Logic and social cognition. The facts matter, and so do computational models
• Logical dynamics of information and interaction
• On the parameterized complexity of multiple-interval graph problems
• Parametrized complexity theory.
• Rational analysis, intractability, and the prospects of `as if'-explanations
• Seeing is believing: formalising false-belief tasks in dynamic epistemic logic
• The complexity of theorem-proving procedures
• The logic of public announcements, common knowledge, and private suspicions
• Tractable competence

Cited in

(7)

• Estimating the use of higher-order theory of mind using computational agents
• Logic and complexity in cognitive science
• Knowledge-based strategies for multi-agent teams playing against nature
• Modelling phenomena and dynamic logic of phenomena
• On the computational complexity of model checking for dynamic epistemic logic with S5 models
• Seeing is believing: formalising false-belief tasks in dynamic epistemic logic
• Parameterized complexity of theory of mind reasoning in dynamic epistemic logic

This page was built for publication: Parameterized complexity results for a model of theory of mind based on dynamic epistemic logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015396)