Quantified conjunctive queries on partially ordered sets

DOI10.1016/J.TCS.2016.01.010MaRDI QIDQ2634671zbMATH OpenOpenAlexFDO

Authors Simone Bova, Robert Ganian, 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

zbMATH Keywords

model checkingparameterized complexityposetsquantified conjunctive queries

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Quantified conjunctive queries on partially ordered sets
• Faster existential FO model checking on posets
• Faster existential FO model checking on posets

Cites work

• Decomposing quantified conjunctive (or disjunctive) formulas
• Faster existential FO model checking on posets
• scientific article; zbMATH DE number 978246 (Why is no real title available?)
• scientific article; zbMATH DE number 1862431 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• scientific article; zbMATH DE number 969067 (Why is no real title available?)
• Linear time solvable optimization problems on graphs of bounded clique-width
• Methods for algorithmic meta theorems
• Parametrized complexity theory.
• Quantified conjunctive queries on partially ordered sets
• Structural sparsity
• The complexity of constraint satisfaction games and QCSP
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(9)

• Ordering conjunctive queries
• Cofinality relation, pre-orders and orders, semantics of ORDER BY clause of querics in SQL-like language
• Quantified conjunctive queries on partially ordered sets
• On the expressive power of the relational algebra with partially ordered domains
• Quantified Constraints in Twenty Seventeen
• scientific article; zbMATH DE number 7297821 (Why is no real title available?)
• Block-Sorted Quantified Conjunctive Queries
• Faster existential FO model checking on posets
• Faster existential FO model checking on posets

This page was built for publication: Quantified conjunctive queries on partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2634671)