Network-based heuristics for constraint satisfaction problems

@inproceedings{Dechter1988NetworkbasedHF,
  title={Network-based heuristics for constraint satisfaction problems},
  author={R. Dechter and J. Pearl},
  year={1988}
}
  • R. Dechter, J. Pearl
  • Published 1988
  • Computer Science
  • Many AI tasks can be formulated as Constraint-Satisfaction problems (CSP), i.e., the assignment of values to variables subject to a set of constraints. While some CSPs are hard, those that are easy can often be mapped into sparse networks of constraints which, in the extreme case, are trees. This paper identifies classes of problems that lend themselves to easy solutions, and develops algorithms that solve these problems optimally. The paper then presents a method of generating heuristic advice… CONTINUE READING
    453 Citations
    Constraint Networks: A Survey
    • Christopher C. Yangt, ' Ming-HsuanYang
    • 2004
    • 33
    • PDF
    Constraint networks: a survey
    • C. Yang, Ming-Hsuan Yang
    • Mathematics
    • 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation
    • 1997
    • 11
    • PDF
    Distributing Constraints by Sampling in Non-Binary CSPs
    • 14
    • PDF
    Distributed Models for solving CSPs
    • 2
    • PDF
    Why is Scheduling Difficult? A CSP Perspective
    • 68
    • PDF
    A quantitative solution to Constraint Satisfaction Problem (CSP)
    A Graph Based Synthesis Algorithm for Solving CSPs
    • 4
    • PDF
    Issues in the performance measurement of constraint-satisfaction techniques
    • 5
    Learned Value-Ordering Heuristics for Constraint Satisfaction
    • 2
    • PDF
    Exploiting the Constrainedness in Constraint Satisfaction Problems
    • 3
    • PDF

    References

    SHOWING 1-10 OF 29 REFERENCES
    The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation
    • 34
    • PDF
    Consistency in Networks of Relations
    • 2,864
    • PDF
    A Sufficient Condition for Backtrack-Free Search
    • 811
    • PDF
    A Method for Computing Heuristics in Problem-Solving
    • 42
    A sufficient condition for backtrack-bounded search
    • 338
    Increasing Tree Search Efficiency for Constraint Satisfaction Problems
    • 1,443
    • PDF
    A Problem Similarity Approach to Devising Heuristics: First Results
    • 71
    • PDF
    On the Discovery and Generation of Certain Heuristics
    • J. Pearl
    • Computer Science, Mathematics
    • AI Mag.
    • 1983
    • 47