The complexity of one-agent refinement modal logic
type: Item
instance of: scholarly article
title: The complexity of one-agent refinement modal logic
zbMATH Open document ID: 1347.03041
author: Laura Bozzelli
author: Sophie Pinchinat
author: Hans van Ditmarsch
published in: Theoretical Computer Science
publication date: 2015-10-12T00:00:00Z
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 6493331
zbMATH Keywords: modal logic
zbMATH Keywords: complexity of satisfiability
zbMATH Keywords: bisimulation quantifiers
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.07.015
OpenAlex ID: W2173381095
cites work: The Complexity of One-Agent Refinement Modal Logic
cites work: Propositional quantifiers in modal logic1
cites work: A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
cites work: ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
cites work: Q3086938
cites work: Simulation and Information: Quantifying over Epistemic Events
cites work: Future event logic -- axioms and complexity
cites work: Alternating-time temporal logic
cites work: Q4525781
cites work: Q4385525
cites work: Q4298260
cites work: Alternation
cites work: A Decision Procedure for the First Order Theory of Real Addition with Order
cites work: Q4449214
cites work: The complexity of logical theories
cites work: Modal logic
DOI: 10.1016/J.TCS.2015.07.015
description: scientific article; zbMATH DE number 6493331