Complexity of Default Logic on Generalized Conjunctive Queries
From MaRDI portal
Recommendations
Cited in
(17)- Complexity of the \(r\)-query tautologies in the presence of a generic oracle
- The complexity of default reasoning under the stationary fixed point semantics
- How hard is completeness reasoning for conjunctive queries?
- Default reasoning using classical logic
- What makes propositional abduction tractable
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- On the parameterized complexity of default logic and autoepistemic logic
- The complexity of reasoning for fragments of default logic
- The Complexity of Reasoning for Fragments of Default Logic
- scientific article; zbMATH DE number 1761409 (Why is no real title available?)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
- Theory and Applications of Satisfiability Testing
- Default logic and bounded treewidth
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
- Common equivalence and size of forgetting from Horn formulae
- Enumeration complexity of conjunctive queries with functional dependencies
- A more general theory of static approximations for conjunctive queries
This page was built for publication: Complexity of Default Logic on Generalized Conjunctive Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425398)