Pages that link to "Item:Q2486582"
From MaRDI portal
The following pages link to The complexity of finite model reasoning in description logics (Q2486582):
Displaying 11 items.
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots (Q414848) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Reasoning about graded strategy quantifiers (Q1706169) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- On representing concepts in finite models (Q2765574) (← links)
- Finding Finite Models in Multi-sorted First-Order Logic (Q2818025) (← links)
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics (Q2999101) (← links)
- Query Answering in Description Logics: The Knots Approach (Q3638272) (← links)
- Automated Deduction – CADE-19 (Q5900710) (← links)
- Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics (Q6104767) (← links)
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates (Q6566618) (← links)