Decomposing constraint satisfaction problems using database techniques
From MaRDI portal
Recommendations
Cites work
- A relational model of data for large shared data banks
- A simplied universal relation assumption and its properties
- A sufficient condition for backtrack-bounded search
- A Sufficient Condition for Backtrack-Free Search
- Computing the Minimum Fill-In is NP-Complete
- Consistency in networks of relations
- Constraint satisfaction from a deductive viewpoint
- Counting representable sets on simple graphs
- Decomposing a relation into a tree of binary relations
- Degrees of acyclicity for hypergraphs and relational database schemes
- Generating hinges from arbitrary subhypergraphs
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 43047 (Why is no real title available?)
- scientific article; zbMATH DE number 3596227 (Why is no real title available?)
- Network-based heuristics for constraint-satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- On the complexity of join dependencies
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Synthesizing constraint expressions
- Testing arbitrary subhypergraphs for the lossless join property
- The combinatorics of object recognition in cluttered environments using constrained search
- The Consistent Labeling Problem: Part I
- Tree clustering for constraint networks
Cited in
(37)- A fast algorithm for query optimization in universal-relation databases
- Constraints, consistency and closure
- Characterising tractable constraints
- Accelerating new product development by overcoming complexity constraints
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- A comparison of structural CSP decomposition methods
- Conjunctive-query containment and constraint satisfaction
- Compiling constraint satisfaction problems
- The power of propagation: when GAC is enough
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- A new tractable class of constraint satisfaction problems
- Constraints in vision. Outline of a set-theoretic approach.
- Fast and parallel decomposition of constraint satisfaction problems
- Tractability beyond -acyclicity for conjunctive queries with negation and SAT
- Large hypertree width for sparse random hypergraphs
- Partition search for non-binary constraint satisfaction
- Domain permutation reduction for constraint satisfaction problems
- Structural tractability of counting of solutions to conjunctive queries
- Generalized hypertree decomposition for solving non binary CSP with compressed table constraints
- On minimal constraint networks
- Hyperconsistency width for constraint satisfaction: Algorithms and complexity results
- STR2: optimized simple tabular reduction for table constraints
- A Logical Approach to Constraint Satisfaction
- Uniform Constraint Satisfaction Problems and Database Theory
- Database queries and constraints via lifting problems
- Tractable constraints on ordered domains
- Tractable constraints on ordered domains
- An algebraic characterization of tractable constraints
- Learning cluster-based structure to solve constraint satisfaction problems
- Constraint reasoning
- Constraint satisfaction -- algorithms and complexity analysis
- Hypertree decompositions and tractable queries
- Any-k algorithms for enumerating ranked answers to conjunctive queries
- Weighted hypertree decompositions and optimal query plans
- A unified theory of structural tractability for constraint satisfaction problems
- Reformulating table constraints using functional dependencies-an application to explanation generation
- On the power of structural decompositions of graph-based representations of constraint problems
This page was built for publication: Decomposing constraint satisfaction problems using database techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321054)
