No article text was recorded for this version.
computational complexity gap
Version 1 of 124 papers26 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
- Blog: Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering
- Blog: On the Universal and Existential Fragments of the μ-Calculus
- Blog: Query Conservative Extensions in Horn Description Logics with Inverse Roles
- Blog: On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions
- Blog: Conjunctive Query Inseparability of OWL 2 QL TBoxes
- Blog: Cardinality Queries over DL-Lite Ontologies
- Blog: Unary negation
- Blog: Deciding SHOQ^cap Knowledge Base Consistency using Alternating Automata
- Blog: Expressivity of Planning with Horn Description Logic Ontologies
- Blog: Query Answering in the Description Logic S
- Blog: Consequence-based Reasoning for Description Logics with Disjunction, Inverse Roles, Number Restrictions, and Nominals
- Blog: The Price of Selfishness: Conjunctive Query Entailment for ALCSelf Is 2EXPTIME-Hard
- Blog: When Are Description Logic Knowledge Bases Indistinguishable?
- Blog: Complexity Landscape for Counting Queries (Extended Abstract)
- Blog: A Description Logic of Change
- Blog: The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
- Blog: Deciding boundedness of monadic sirups
- Blog: Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
- Blog: Query Answering in Description Logics with Transitive Roles
- Blog: Enumerating teams in first-order team logics
- Blog: Fusions of Description Logics and Abstract Description Systems
- Blog: Probabilistic Logic Programming under the L-Stable Semantics
- Blog: Query Answering over DL ABoxes: How to Pick the Relevant Symbols
History & citation
Current · Permanent link
- This direction split from Closing Computational Complexity Gaps in Logic (92% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_complexity_gap_46ebf2cb,
title = {computational complexity gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-gap/rdr_46ebf2cb7c844d829e8515e14d2517df},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_computational_complexity_gap_46ebf2cb_v1,
title = {computational complexity gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-gap/rdr_46ebf2cb7c844d829e8515e14d2517df/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}