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

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

Latest revision as of 14:28, 22 May 2024

scientific article
Language Label Description Also known as
English
Decomposing constraint satisfaction problems using database techniques
scientific article

    Statements

    Decomposing constraint satisfaction problems using database techniques (English)
    0 references
    0 references
    0 references
    0 references
    2 January 1995
    0 references
    constraint satisfaction
    0 references
    satisfaction of join-dependencies
    0 references
    relational database
    0 references
    hypergraph
    0 references
    efficiency
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references