How many variables are needed to express an existential positive query?
From MaRDI portal
Recommendations
- How many variables are needed to express an existential positive query?
- On the complexity of existential positive queries
- How many first-order variables are needed on finite ordered structures?
- The complexity of equivalence, entailment, and minimization in existential positive logic
- Number of variables is equivalent to space
Cites work
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- Beyond Q-resolution and prenex form: a proof system for quantified constraint satisfaction
- Computer Science Logic
- Graph theory
- How many variables are needed to express an existential positive query?
- On Moschovakis closure ordinals
- On the Power of k-Consistency
- On the complexity of existential positive queries
- On the expressive power of Datalog: tools and a case study.
- One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The core of a graph
- The tractability frontier of graph-like first-order query sets
- Tree-width for first order formulae
- Upper and lower bounds for first order expressibility
Cited in
(2)
This page was built for publication: How many variables are needed to express an existential positive query?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322719)
