Uniform Constraint Satisfaction Problems and Database Theory
From MaRDI portal
Recommendations
- A comparison of structural CSP decomposition methods
- Conjunctive-query containment and constraint satisfaction
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- A unified theory of structural tractability for constraint satisfaction problems
Cites work
- A backtracking-based algorithm for hypertree decomposition
- A comparison of structural CSP decomposition methods
- A complexity theory based on Boolean algebra
- A simplied universal relation assumption and its properties
- A sufficient condition for backtrack-bounded search
- A unified theory of structural tractability for constraint satisfaction problems
- Alternation
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Closures of database hypergraphs
- Computing LOGCFL certificates
- Conjunctive query containment revisited
- Conjunctive-query containment and constraint satisfaction
- Constraints, MMSNP and expander relational structures
- Data exchange: getting to the core
- Deciding first-order properties of locally tree-decomposable structures
- Decomposing constraint satisfaction problems using database techniques
- Graph minors. II. Algorithmic aspects of tree-width
- Graph searching and a min-max theorem for tree-width
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3571498 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Hypertree decompositions and tractable queries
- Hypertree-width and related hypergraph invariants
- Marshals, monotone marshals, and hypertree-width
- On Determining Tree Query Membership Of A Distributed Query
- On the Desirability of Acyclic Database Schemes
- On the Power of k-Consistency
- On the Restraining Power of Guards
- Optimization of distributed tree queries
- Power of Natural Semijoins
- Query evaluation via tree-decompositions
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Some intersection theorems for ordered sets and graphs
- The complexity of acyclic conjunctive queries
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The Hardest Context-Free Language
- Tour merging via branch-decomposition
- Tree decompositions with small cost
- Tree queries
- Tree-size bounded alternation
- Undirected ST-connectivity in log-space
- Weighted hypertree decompositions and optimal query plans
- When is the evaluation of conjunctive queries tractable?
Cited in
(15)- Decomposing constraint satisfaction problems using database techniques
- A comparison of structural CSP decomposition methods
- Conjunctive-query containment and constraint satisfaction
- Structural tractability of enumerating CSP solutions
- Uniform generation in spatial constraint databases and applications
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- Typed Guarded Decompositions for Constraint Satisfaction
- Enumerating homomorphisms
- scientific article; zbMATH DE number 1253959 (Why is no real title available?)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Tractable structures for constraint satisfaction with truth tables
- Database queries and constraints via lifting problems
- Incremental Updates of Generalized Hypertree Decompositions
- A unified theory of structural tractability for constraint satisfaction problems
- On the power of structural decompositions of graph-based representations of constraint problems
This page was built for publication: Uniform Constraint Satisfaction Problems and Database Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504703)
