"Ontology-Mediated Queries: Combined Complexity and Succinctness of ..."

Meghyn Bienvenu et al. (2018)

> Home

Details and statistics

DOI: 10.1145/3191832

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/BienvenuKKPZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/BienvenuKKPZ18
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. J. ACM 65(5): 28:1-28:51 (2018)

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.