• DOI:10.1007/978-1-4613-8788-6_11
Corpus ID: 209053992

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

View via Publisher

Save to Library

Create Alert

Cite

Launch Research Feed