Exploring the tractability border in epistemic tasks
type: Item
instance of: scholarly article
title: Exploring the tractability border in epistemic tasks
zbMATH Open document ID: 1310.03022
author: Cédric Dégremont
author: Lena Kurzen
author: Jakub Szymanik
published in: Synthese
publication date: 2015-01-08T00:00:00Z
Mathematics Subject Classification ID: 03B42
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T42
zbMATH DE Number: 6384576
zbMATH Keywords: epistemic logic
zbMATH Keywords: computational complexity
zbMATH Keywords: epistemic reasoning
zbMATH Keywords: multi-agent systems
MaRDI profile type: Publication
full work available at URL: s11229-012-0215-7
OpenAlex ID: W1978670170
cites work: Group announcement logic
cites work: An internal version of epistemic logic
cites work: Interactive epistemology. I: Knowledge
cites work: ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
cites work: Deciding bisimilarity is P-complete
cites work: Logics for epistemic programs
cites work: The Logic of Public Announcements, Common Knowledge, and Private Suspicions
cites work: Knowledge updates: Semantics and complexity issues
cites work: Modal logic
cites work: Generalized quantifiers and modal logic
cites work: Paths, Trees, and Flowers
cites work: Q4845472
cites work: Reinforcement-based vs. Belief-based Learning Models in Experimental Asymmetric-information Games
cites work: Q3086938
cites work: Q4198056
cites work: Invariance Properties of Quantifiers and Multiagent Information Exchange
cites work: A guide to completeness and complexity for modal logics of knowledge and belief
cites work: The complexity of reasoning about knowledge and time. I: Lower bounds
cites work: Q4252730
cites work: Group-theoretic algorithms and graph isomorphism
cites work: Reducibility among Combinatorial Problems
cites work: Q4273947
cites work: Q4484513
cites work: Q3576736
cites work: Q3221403
cites work: Q4739657
cites work: LOGICS FOR THE RELATIONAL SYLLOGISTIC
cites work: Q3781066
cites work: Logical Dynamics of Information and Interaction
cites work: Q3509047
cites work: Simulation and Information: Quantifying over Epistemic Events
cites work: Dynamic Epistemic Logic and Knowledge Puzzles
cites work: Logic and social cognition. The facts matter, and so do computational models
DOI: 10.1007/S11229-012-0215-7
Recommended article: Q3204443
Recommended article: Q5711867
Recommended article: Some Computational Constraints in Epistemic Logic
Recommended article: Epistemic Argumentation Framework: Theory and Computation
Recommended article: Taming the Complexity of Temporal Epistemic Reasoning
Recommended article: Q4509295
Recommended article: Transepistemic abduction: reasoning across epistemic domains
Recommended article: Q5740435
Recommended article: Q4022226
description: scientific article; zbMATH DE number 6384576