Block-Sorted Quantified Conjunctive Queries

DOI10.1007/978-3-642-39212-2_14MaRDI QIDQ5327428zbMATH OpenOpenAlexFDO

Authors Hubie Chen, Dániel Marx

Publication date 7 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL http://eprints.sztaki.hu/9349/

Mathematics Subject Classification ID

Logic in computer science (03B70) Database theory (68P15) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Quantified conjunctive queries on partially ordered sets
• Quantified conjunctive queries on partially ordered sets
• Optimization of quasiconjunctive queries
• Efficient Approximations of Conjunctive Queries
• scientific article; zbMATH DE number 1951561
• Optimization of bound disjunctive queries with constraints
• Conjunctive-query containment and constraint satisfaction
• Conjunctive query containment revisited
• A more general theory of static approximations for conjunctive queries

Cited in

(5)

• Optimization of quasiconjunctive queries
• Characterizing tractability of simple well-designed pattern trees with projection
• Quantified Constraints in Twenty Seventeen
• scientific article; zbMATH DE number 7561480 (Why is no real title available?)
• Decomposing Quantified Conjunctive (or Disjunctive) Formulas

This page was built for publication: Block-Sorted Quantified Conjunctive Queries

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