Decomposing constraint satisfaction problems using database techniques (Q1321054): Difference between revisions

@@ Property / author @@
-Peter G. Jeavons
@@ Property / author: Peter G. Jeavons / rank @@
-Normal rank
@@ Property / author @@
-David A. Cohen
@@ Property / author: David A. Cohen / rank @@
-Normal rank
@@ Property / author @@
+Peter G. Jeavons
@@ Property / author: Peter G. Jeavons / rank @@
+Normal rank
@@ Property / author @@
+David A. Cohen
@@ Property / author: David A. Cohen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0004-3702(94)90003-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1978282744
@@ Property / OpenAlex ID: W1978282744 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint satisfaction from a deductive viewpoint
+Normal rank
@@ Property / cites work @@
+A relational model of data for large shared data banks
+Normal rank
@@ Property / cites work @@
+Decomposing a relation into a tree of binary relations
+Normal rank
@@ Property / cites work @@
+Network-based heuristics for constraint-satisfaction problems
+Normal rank
@@ Property / cites work @@
+Tree clustering for constraint networks
@@ Property / cites work: Tree clustering for constraint networks / rank @@
+Normal rank
@@ Property / cites work @@
+Solving a cutting-stock problem with the constraint logic programming language CHIP
+Normal rank
@@ Property / cites work @@
+Degrees of acyclicity for hypergraphs and relational database schemes
+Normal rank
@@ Property / cites work @@
+A simplied universal relation assumption and its properties
+Normal rank
@@ Property / cites work @@
+Synthesizing constraint expressions
@@ Property / cites work: Synthesizing constraint expressions / rank @@
+Normal rank
@@ Property / cites work @@
+A Sufficient Condition for Backtrack-Free Search
@@ Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for backtrack-bounded search
+Normal rank
@@ Property / cites work @@
+The combinatorics of object recognition in cluttered environments using constrained search
+Normal rank
@@ Property / cites work @@
+On the complexity of join dependencies
@@ Property / cites work: On the complexity of join dependencies / rank @@
+Normal rank
@@ Property / cites work @@
+The Consistent Labeling Problem: Part I
@@ Property / cites work: The Consistent Labeling Problem: Part I / rank @@
+Normal rank
@@ Property / cites work @@
+Counting representable sets on simple graphs
@@ Property / cites work: Counting representable sets on simple graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Consistency in networks of relations
@@ Property / cites work: Consistency in networks of relations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3668890
@@ Property / cites work: Q3668890 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating hinges from arbitrary subhypergraphs
@@ Property / cites work: Generating hinges from arbitrary subhypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Testing arbitrary subhypergraphs for the lossless join property
+Normal rank
@@ Property / cites work @@
+Networks of constraints: Fundamental properties and applications to picture processing
+Normal rank
@@ Property / cites work @@
+Q3992720
@@ Property / cites work: Q3992720 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4162638
@@ Property / cites work: Q4162638 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank