Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Meseguer, Pedro
Affiliations: Centre d'Estudis Avancats de Blanes, C.S.I.C Cami de Santa Barbara, 17300 Blanes, Girona, Spain, E-mail: pedro@ceab.es
Abstract: Many AI problems can be formulated as Constraint Satisfaction Problems (CSP). Using a systematic search process with backtracking this kind of problems can be solved, but this method is very inefficient. Other methods solving CSP have been developed showing a better performance. In this paper an overview of methods (algorithms and heuristics) solving CSP is presented, stressing the key ideas underlying the different methods.
DOI: 10.3233/AIC-1989-2101
Journal: AI Communications, vol. 2, no. 1, pp. 3-17, 1989
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl