Decomposing quantified conjunctive (or disjunctive) formulas
From MaRDI portal
Recommendations
Cited in
(15)- Characterizing tractability of simple well-designed pattern trees with projection
- Using decomposition-parameters for QBF: mind the prefix!
- Bounded-width QBF is PSPACE-complete
- Using binary patterns for counting falsifying assignments of conjunctive forms
- Quantified conjunctive queries on partially ordered sets
- Structural tractability of counting of solutions to conjunctive queries
- Quantified conjunctive queries on partially ordered sets
- On the complexity of the model checking problem
- The complexity of weighted counting for acyclic conjunctive queries
- Quantified Constraints in Twenty Seventeen
- scientific article; zbMATH DE number 7561480 (Why is no real title available?)
- On the complexity of existential positive queries
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
- Generalized model-checking over locally tree-decomposable classes
- On the shortest path game
This page was built for publication: Decomposing quantified conjunctive (or disjunctive) formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986797)