Why propositional quantification makes modal logics on trees robustly hard ?
Aus International Center for Computational Logic
Why propositional quantification makes modal logics on trees robustly hard ?
Bartosz BednarczykBartosz Bednarczyk, Stéphane DemriStéphane Demri

Bartosz Bednarczyk, Stéphane Demri
Why propositional quantification makes modal logics on trees robustly hard ?
LICS 2019, to appear
Why propositional quantification makes modal logics on trees robustly hard ?
LICS 2019, to appear
- Forschungsgruppe:Research Group: Computational LogicComputational Logic
@inproceedings{BD2019,
author = {Bartosz Bednarczyk and St{\'{e}}phane Demri},
title = {Why propositional quantification makes modal logics on trees
robustly hard ?},
booktitle = {LICS 2019},
year = {2019},
month = {June}
}