Pages that link to "Item:Q2661762"
From MaRDI portal
The following pages link to Parameterized complexity of completeness reasoning for conjunctive queries (Q2661762):
Displaying 11 items.
- Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
- Combined-semantics equivalence of conjunctive queries: decidability and tractability results (Q899579) (← links)
- Complexity of the \(r\)-query tautologies in the presence of a generic oracle (Q1861135) (← links)
- How hard is completeness reasoning for conjunctive queries? (Q2019449) (← links)
- Completeness guarantees for incomplete ontology reasoners: theory and practice (Q2887081) (← links)
- The complexity of acyclic conjunctive queries (Q3196620) (← links)
- On the convergence of query-bounded computations and logical closure properties of c.e. sets (Q4328820) (← links)
- Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912) (← links)
- Theory and Applications of Satisfiability Testing (Q5714771) (← links)
- The resilience of conjunctive queries with inequalities (Q6205020) (← links)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\) (Q6535408) (← links)