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

Bartosz Bednarczyk, Stéphane Demri (2019)

> Home

Details and statistics

DOI: 10.1109/LICS.2019.8785656

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lics/BednarczykD19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lics/BednarczykD19
Bartosz Bednarczyk, Stéphane Demri:
Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? LICS 2019: 1-13

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.