Compute-intensive methods in artificial intelligence

Authors
Citation
B. Selman, Compute-intensive methods in artificial intelligence, ANN MATH A, 28(1-4), 2000, pp. 35-38
Citations number
27
Categorie Soggetti
Engineering Mathematics
Journal title
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
ISSN journal
10122443 → ACNP
Volume
28
Issue
1-4
Year of publication
2000
Pages
35 - 38
Database
ISI
SICI code
1012-2443(2000)28:1-4<35:CMIAI>2.0.ZU;2-3
Abstract
In order to deal with the inherent combinatorial nature of many tasks in ar tificial intelligence, domain-specific knowledge has been used to control s earch and reasoning or to eliminate the need for general inference altogeth er. However, the process of acquiring domain knowledge is an important bott leneck in the use of such "knowledge-intensive" methods. Compute-intensive methods, on the other hand, use extensive search and reasoning strategies t o limit the need for detailed domain-specific knowledge. The idea is to der ive much of the needed information from a relatively compact formalization of the domain under consideration. Up until recently, such general reasonin g strategies were much too expensive for use in applications of interesting size but recent advances in reasoning and search methods have shown that c ompute-intensive methods provide a promising alternative to knowledge-inten sive methods.