Parameterized complexity results for a model of theory of mind based on dynamic epistemic logic
zbMATH Open1483.68387arXiv1606.07526MaRDI QIDQ5015396FDOQ5015396
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
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
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)
Cites Work
- Fundamentals of parameterized complexity
- Epistemic planning for single- and multi-agent systems
- The logic of public announcements, common knowledge, and private suspicions
- Parametrized complexity theory.
- Logical dynamics of information and interaction
- The complexity of theorem-proving procedures
- Title not available (Why is that?)
- Dynamic epistemic logic
- On the parameterized complexity of multiple-interval graph problems
- Title not available (Why is that?)
- Tractable competence
- Intractability and the use of heuristics in psychological explanations
- Invariance Properties of Quantifiers and Multiagent Information Exchange
- Exploring the tractability border in epistemic tasks
- Logic and social cognition. The facts matter, and so do computational models
- An internal version of epistemic logic
- Rational analysis, intractability, and the prospects of `as if'-explanations
- Children's application of theory of mind in reasoning and language
- Describing parameterized complexity classes
- Logic and complexity in cognitive science
- Hybrid-logical reasoning in the Smarties and Sally-Anne tasks
- Seeing is believing: formalising false-belief tasks in dynamic epistemic logic
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)
