Fast Parallel Constraint Satisfaction

@article{Kirousis1993FastPC,
  title={Fast Parallel Constraint Satisfaction},
  author={L. Kirousis},
  journal={Artif. Intell.},
  year={1993},
  volume={64},
  pages={147-160}
}
  • L. Kirousis
  • Published 1993
  • Mathematics, Computer Science
  • Artif. Intell.
  • A Constraint Satisfaction Problem (CSP) involves searching for an assignment of values to a given set of variables so that the values assigned satisfy a given set of constraints. The general CSP is NP-complete. To confront the intractability of the general CSP, relaxation procedures have been devised: instead of searching for a globally consistent assignment of values to the variables, try to restrict the domain of values of each variable in a way that ensures local consistency only. The… CONTINUE READING
    53 Citations
    Dynamic algorithms for classes of constraint satisfaction problems
    • 4
    • PDF
    Constraint Satisfaction
    • 226
    • PDF
    A Graph Based Backtracking Algorithm for Solving General CSPs
    • 7
    • PDF
    Using Pivot Consistency to Decompose and Solve Functional CSPs
    • P. David
    • Mathematics, Computer Science
    • J. Artif. Intell. Res.
    • 1995
    • 21
    • PDF
    Closure properties of constraints
    • 481
    Handbook of Constraint Programming
    • 1,386
    • PDF
    On the minimality and global consistency of row-convex constraint networks
    • 135
    • PDF
    Tractable Constraints on Ordered Domains
    • 164
    • PDF
    The complexity of soft constraint satisfaction
    • 135
    • PDF

    References

    SHOWING 1-10 OF 32 REFERENCES
    Constraint Relaxation may be Perfect
    • 98
    On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks
    • S. Kasif
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1990
    • 164
    A Generic Arc-Consistency Algorithm and its Specializations
    • 499
    • PDF
    On the Minimality and Decomposability of Constraint Networks
    • 50
    • PDF
    A Sufficient Condition for Backtrack-Free Search
    • 811
    • PDF
    The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems
    • 741
    A Taxonomy of Problems with Fast Parallel Algorithms
    • S. Cook
    • Mathematics, Computer Science
    • Inf. Control.
    • 1985
    • 683
    Arc Consistency: Parallelism and Domain Dependence
    • 69
    Parallel and distributed algorithms for finite constraint satisfaction problems
    • Y. Zhang, Alan K. Mackworth
    • Computer Science
    • Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing
    • 1991
    • 68
    • PDF
    A sufficient condition for backtrack-bounded search
    • 338