Quantified conjunctive queries on partially ordered sets
From MaRDI portal
Publication:2634671
DOI10.1016/j.tcs.2016.01.010zbMath1335.68133OpenAlexW1587299800MaRDI QIDQ2634671
Robert Ganian, Simone Bova, Stefan Szeider
Publication date: 18 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.010
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of constraint satisfaction games and QCSP
- Linear time solvable optimization problems on graphs of bounded clique-width
- Parametrized complexity theory.
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Structural sparsity
- Quantified Conjunctive Queries on Partially Ordered Sets
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Model checking existential logic on partially ordered sets
- Deciding First-Order Properties of Nowhere Dense Graphs
- Faster Existential FO Model Checking on Posets
