Tableau Method and NEXPTIME-Completeness of DEL-Sequents

DOI10.1016/j.entcs.2011.10.003zbMath1347.03021OpenAlexW2161395093WikidataQ113318205 ScholiaQ113318205MaRDI QIDQ2825404

Bastien Maubert, François Schwarzentruber, Guillaume Aucher

Publication date: 7 October 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.10.003

zbMATH Keywords

computational complexitytableau methoddynamic epistemic logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Agent technology and artificial intelligence (68T42)

Related Items (4)

Generalized DEL-Sequents ⋮ DEL-sequents for regression and epistemic planning ⋮ DEL-sequents for progression ⋮ DEL-sequents for progression

Uses Software

• LoTREC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logics for epistemic programs
• The Logic of Public Announcements, Common Knowledge, and Private Suspicions
• Terminating Tableaux for Dynamic Epistemic Logics
• Tableaux for Public Announcement Logic
• Automated Reasoning with Analytic Tableaux and Related Methods

This page was built for publication: Tableau Method and NEXPTIME-Completeness of DEL-Sequents