Search dblp for Publications

export results for "Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?"

 download as .bib file

@article{DBLP:journals/corr/abs-2104-13122,
  author       = {Bartosz Bednarczyk and
                  St{\'{e}}phane Demri},
  title        = {Why Propositional Quantification Makes Modal and Temporal Logics on
                  Trees Robustly Hard?},
  journal      = {CoRR},
  volume       = {abs/2104.13122},
  year         = {2021},
  url          = {https://arxiv.org/abs/2104.13122},
  eprinttype    = {arXiv},
  eprint       = {2104.13122},
  timestamp    = {Mon, 03 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2104-13122.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/lics/BednarczykD19,
  author       = {Bartosz Bednarczyk and
                  St{\'{e}}phane Demri},
  title        = {Why Propositional Quantification Makes Modal Logics on Trees Robustly
                  Hard?},
  booktitle    = {34th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
                  2019, Vancouver, BC, Canada, June 24-27, 2019},
  pages        = {1--13},
  publisher    = {{IEEE}},
  year         = {2019},
  url          = {https://doi.org/10.1109/LICS.2019.8785656},
  doi          = {10.1109/LICS.2019.8785656},
  timestamp    = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl       = {https://dblp.org/rec/conf/lics/BednarczykD19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.