"The Precise Complexity of Reasoning in 𝒜ℒ𝒞 with ..."

Stefan Borgwardt, Filippo De Bortoli, Patrick Koopmann (2024)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2024-08-21

- view
  - electronic edition @ ceur-ws.org (open access)
- export record
  dblp key:
  - conf/dlog/BorgwardtBK24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlog/BorgwardtBK24
Stefan Borgwardt, Filippo De Bortoli, Patrick Koopmann:
The Precise Complexity of Reasoning in 𝒜ℒ𝒞 with ω-Admissible Concrete Domains. Description Logics 2024

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.