No article text was recorded for this version.
finite model reasoning complexity
Version 1 of 134 papers44 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Scheme for Integrating Datatype Groups into Description Logics
- Blog: Reasoning Support for OWL-E
- Blog: A Scheme for Integrating
- Blog: On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions
- Blog: Generalized link properties for expressive ε-connections of description logics
- Blog: Query Rewriting for DL-Lite with n-ary Concrete Domains
- Blog: A Scheme for Integrating Concrete Domains into Concept Languages
- Blog: Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses
- Blog: Abstract: The Extended Theory of Trees and Algebraic (Co)datatypes
- Blog: Epistemic Disjunctive Datalog for Querying Knowledge Bases
- Blog: Reifying Concepts in Description Logics
- Blog: Multi-Dimensional Description Logics
- Blog: Combining Existential Rules and Transitivity: Next Steps
- Blog: OWL-Eu: Adding Customised Datatypes into OWL
- Blog: Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
- Blog: Data Complexity in the EL family of DLs
- Blog: Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles
- Blog: A Tableau Algorithm for DLs with Concrete Domains and GCIs
- Blog: Reasoning with Concrete Domains
- Blog: The Complexity of Finite Model Reasoning in Description Logics
- Blog: Pushing the EL Envelope
- Blog: On Prototypes for Winslett's Semantics of DL-Lite ABox Evolution
- Blog: Finite Entailment of Local Queries in the Z Family of Description Logics
- Blog: Introducing Customised Datatypes and Datatype Predicates into OWL
- Blog: Fusions of Description Logics and Abstract Description Systems
- Blog: What's in an Aggregate: Foundations for Description Logics with Tuples and
- Blog: Complexity Boundaries for Horn Description Logics
- Blog: Decidability and Complexity of ALCOIF with Transitive Closure (and More)
- Blog: Extending DL Reasoning Support for the OWL Datatyping (or "Why Datatype Groups?")
- Blog: On the Decidability of Role Mappings between Modular Ontologies
- Blog: Boosting the Correspondence between Description Logics and Propositional Dynamic Logics
- Blog: Reasoning in Expressive Description Logics with
- Blog: Finite Model Reasoning in ALCQI is EXPTIME Logics
- Blog: A New n-Ary Existential Quantifier in Description Logics
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_finite_model_reasoning_complexity_cb4bc699,
title = {finite model reasoning complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/finite-model-reasoning-complexity/rdr_cb4bc69975864d638d2758b1621bc9f7},
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_finite_model_reasoning_complexity_cb4bc699_v1,
title = {finite model reasoning complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/finite-model-reasoning-complexity/rdr_cb4bc69975864d638d2758b1621bc9f7/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}