Constraint satisfaction algorithms

Abstract

Constraint satisfaction problems are ubiquitous in artificial intelligence and many algorithms have been developed for their solution. This paper provides a unified survey of some of these, in terms of three classes: ( i ) tree search, ( i i ) arc consistency (AC), and (iii) hybrid tree search/arc consistency algorithms. It is shown that several important… (More)
DOI: 10.1111/j.1467-8640.1989.tb00328.x

Statistics

02040'89'92'95'98'01'04'07'10'13'16
Citations per Year

304 Citations

Semantic Scholar estimates that this publication has 304 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Nadel1989ConstraintSA, title={Constraint satisfaction algorithms}, author={Bernard A. Nadel}, journal={Computational Intelligence}, year={1989}, volume={5}, pages={188-224} }