Modal logics with hard diamond-free fragments
From MaRDI portal
Publication:5108014
DOI10.1093/logcom/exaa001WikidataQ126399225 ScholiaQ126399225MaRDI QIDQ5108014
Publication date: 29 April 2020
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.5846
computational complexity; modal logic; lower bounds; satisfiability; multi-modal; diamond-free fragments
68Q25: Analysis of algorithms and problem complexity
03B45: Modal logic (including the logic of norms)