It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
The Lexical Access Problem consists of determining the intended sequence of words corresponding to an input sequence of phonemes (basic speech sounds) that come from a low-level p...
Ian E. Thomas, Ingrid Zukerman, Jonathan J. Oliver...
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devote...
Weshowthat by inferring parametexdomainsof planningoperators,given the definitions of the operators and the initial and goal conditions, we can often speed up the planning process...
The Assumption-Based Truth Maintenance System (ATMS) is an important tool in A I . So far its wider use has been limited due to the enormous computational resources which it requi...