Table Of Content

Artificial Intelligence Master Index—vVolumes 121—130 Abdelbar, A.M., S.T. Hedetniemi and S.M. Hedetniemi The complexity of approximating MAPs for belief networks with bounded probabilities (Research Note) 124 (2000) Sailey-Kellogg, C. and F. Zha Influence-based model decomposition for reasoning about spatially distributed physical systems (2001) .C., V. Kreinovich and R. Trejo Computational complexity of planning and approximate plan ning in the presence of incompleteness 2 (2000) Baral, C., see Son, T.¢ 5 (2001) Beck, J.C. and M.S. Fox Constraint-directed techniques for scheduling alternative ac tivities (2000) Becker, A. and D. Geiget \ sufficiently fast algorithm for finding close to optimal clique trees 2001) Benferhat, S., A. Saffiotti and P. Smets Belief functions and defauli reasoning 2000) Berzins, M. Review of The Computational Beauty of William Flake (Book Review) 2001) Besnard, P. and A. Hunter \ logic-based theory of deductive arguments 28 (2001) Biswas, G., see Mosterman, P.J 2000) Bode, M., O. Freyd, J. Fischer, F.-J. Niedernostheide and H.-J Schulze Hybrid hardware for a highly parallel search in the context of learning classifiers 2001) 0004-3702/2001 Published by Elsevier Science B.V PII: S0004-3702(01)00137-0 s heuristic search Dearden and M. Goldszmidt with ta 2000 R.I. and M. Tennenholtz optimal polynomial time = certain classes « I StOC nastic games O00 Broda, K., see d’ Avila Garcez, A.S (2001) Burgard, W., see Thrun, S 200] MIT En ‘rt Wilson and Frank Keil (Book Review) M., P. Régnier and V. Vidal Least commitment in Graphplan hakrabarti, P.P., see Dasgupta, P \.. M. Frixione andS . Gaglio erstanding dynamic scene: 3 (2000) i, K.M.F., J.H.M. Lee and P.J. Stuckey \ Lagrangian reconstructiono f GENET 2000) Chow, T.W.S., see Leung, 2001 Cohn, A.G e , 2000) Recursive conditioning 2001) Dasgupta, P., P.P. Chakrabarti, J. Kumar Deka and S. Sankara narayanan Min-max Computation Tree Logic 2001) d’ Avila Garcez, A.S., K. Broda and D.M. Gabbay Symbolic knowledge extraction from trained neural networks \ sound approach 5 (2001) | Dean, T., see Givan, R 22 (2000) Dearden, R., see Boutilier, ¢ (2000) *r, R. and Y. El Fattah fopological parameters for time-space tradeoft (2001) Dechter, R., see Kask, K 29 (2001) Dechter, R., see Zhang, W 29 (2001) De Giacomo, G., Y. Lespérance and H.J. Levesque ConGolog, a concurrent programming language based on the situation calculus 2000) Delgrande, J.P. and T. Schaub Expressing preferences in default logic 23 (2000) 41 Dellaert, F., see Thrun, S (2001) 99 Dix, J.. S. Kraus and V.S. Subrahmanian lemporal agent programs 27 (2001) 87 Donini, F.M. and F. Massacci EXPTIME tableaux for ALC 2000) 87 Dorndorf, U., E. Pesch and T. Phan-Huy Constraint propagation techniques for the disjunctive schedul ing problem 2000) 189 Dorr, B.J Review of Natural Language Processing in R.A. Wilson and F.C. Keil (Eds.), The MIT Encyclopedia of the Cognitive Sciences (Book Review) (2001) 185 du Boulay, Benedict N.J. Nilsson, Artificial Intelligence 4 New Synthesis; T Dean, J. Allen and Y. Aloimonos, Artificial Intelligence Theory and Practice; D. Poole, A.M ackworth and R. Goebel, ( omputational li le llige Ice j l O22 al Approae he: »s Russell and P. Norvig, Artificial Intelligence: A Modern Approach (Book Review) 2001) Dufourd, J.-F., see Essert- Villard, ¢ 2000) Edelkamp, S., see Korf, R.f 2001) Eiter, T. and T. Lukasiewicz Default reasoning from conditional knowledge bases: Com plexity and tractable cases (2000) 169 El Fattah, Y., see Dechter, R 5 (2001) Essert- Villard, C., P. Schreck and J.-F. Dufourd Sketch-based pruning of a solution space within a formal geometric constraint solver 124 (2000) Etxeberria, R., see Inza, | 123 (2000) Fenner, T.I., see Levene, M 130 (2001) Finkelstein, L. and S. Markovitch Optimal schedules for monitoring anytime algorithms 126 (2001) Fischer, J., see Bode, M 130 (2001) Flake, G.W G.W. Flake, The Computational Beauty of Nature (Response) 128 (2001) Forrest, S., see Moses, M 128 (2001) Fox, D., see Thrun, S 128 (2001) Fox, M.S., see Beck, J.C 121 (2000) FreyOd.,, s ee Bode, M. 130 (2001) Frixione, M., see Chella, A 123 (2000) Gabbay, D.M., see d’ Avila Garcez, A.S. 5 (2001) Gaglio, S., see Chella, A 3 (2000) Gao, Q., M. Li and P. Vitanyi Applying MDL to learn best model granularity 21 (2000) e Bonet, B Becker, A and T. Wal HM) Local Models Semanti compatibility 2001) see Ghidini 2001) S. Leach and T. Dean l-parameter Markov decisi oce . 122 (2000 iobet, F., see Lane, P.C.R 7 (2001 joldszmidt, M., see Boutiliei (2000) somes, ( a >. Selman Algorithm portfolios N. Leone and F. Scarcello \ comparison of structural CSP decomposition method (2000) Hansen, E.A. andS . Zilberstein Monitoring and control of programming approach Hansen, E.A. andS . Zilberstein LAO \ heuristic search algorithm that finds loops 2001 Hausser, R Database semantic iatural language 2001) He. J. and X. Yao Drift analysis and average time complexity algorithms (2001) Hedetniemi, S.M., see Abdelbar, A.M 2000) Hedetniemi, S.T., see Abdelbar, A.M 2000) Hernandez-Orallo, J Truth from Trash. Ho Thornton (Book Review) (2000 Horty, J.F. and M.E. Pollack Evaluating new options in the context of existing pk 2001 Horvath, T. and G. Turan Learning logic programs with structured background knowl edge 2001 Horvitz, | Prinacndi appplilcateiosns of continual computation 2001 196 Horvitz, E. andS . Zilberstein Computational tradeoffs under bounded resources 2001 Hunter, A., see Besnard, P 2001 Husbands, P Cognitive Science: Real or Imaginary?: Review of The MIT Encyclopedia of The Coeniti ciences edited by Robert A Wilson and Frank C. Keil (Book Review 130 (2001) lida, H., see Seo, M 129 ~ OO1) Inoue, K., see Sakama, ( 123 UUU) Inza, I., P. Larrafiaga, R. Etxeberria and B. Sierra Feature Subset Selection by Bayesian network-based opti ~ mization VUU) Ishi, A. and A.G. Cohn \ new approach to cyclic g of 2D orientations using ternary relation algebras ~ UUU Jiménez, P. and C. Torras \n efficient algorithm for searching implicit AND/OR graphs with cycles ~ UOU Junghanns, A. and J. Schaefte Sokoban: Enhancing general -agent search methods ising domain knowledge ask, K. and R. Dechter \ general scheme for automatic generation of search heuris tics from specification dependencies Keil, F.C rhe scope of the cognitive y to 6 reviewso f Thre MIT Encyclopedia of tl ogniti ciences (Response) 2001 Koenig, S Minimax real-time heuristic search 200 Kort, R.E., M. Reid and S. Edelkamp rime complexity of iterative-deepening-A (2001 Korf, R.E., see Zhang, W 200] Koubarakis, M. and S. Skiadopoulos Querying temporal and spatial constraint networks in PTIMI ( 2000) Kraus, S., see Dix, J ( 2001) Kreinovich, V., see Baral, ¢ { 2000) Kumar Deka, J., see Dasgupta, P { 2001) Lakoff,G As advertised: A review of The MIT Encyclopedia of the Cognitive Sciences (Book Review) (2001) Lane, P.C.R. and F. Gobet Simple environments fail as illustrations of intelligence: A re view of R. Pfeifer and C. Scheier, Understanding Intelligence 2001) 261 Larranaga, P., see Inza, | 2000) 157 Laurentini, A fopological recognition of polyhedral objects from multiple views sach, S., see Givan, R> (2000) -e, JLH.M see Choi K.M.f (2000) *itgeb, H Nonmonotonic reasoning by inhibition nets (2001) one, N . SCC ( i0ttlob. G (2000) -spérance, Y., see De Giacomo, G (2000) ung, C.-T. and T.W.S. Chow Least third-order cumulant method with adaptive regulariza tion parameter selection for neural networks (2001) vene, M. and T.1 Fenner The effect of mobility on minimaxing of game trees with random leaf values 130 (2001) evesque, H.J., see De Giacomo, G 121 (2000) i, M., see Gao, Q 121 (2000) M. Shanahan, Solving the Fri dil¢ Probl HPT | Book Rev 1eW ) (2000) in, F On strongest necessary and weakest sufficient conditions (2001) inhares, A \ glimpse at the metaphysics of Bongard problems (2000) inke, T and 7 Schaub Alternative foundations for Reiter's default logic 124 (2000) Lukasiewicz, T., see Eiter, 1 124 (2000) Markovitch, S., see Finkelstein, I 126 (2001) Massacci, F., see Donini, F.M 124 (2000) Matsubara, S., see Yokoo, M 130 (2001) McCarthy, J M. Shanahan, Solving the Frame Problem (Book Review) 123 (2000) Meseguer P. and ¢ Torras Exploiting symmetries within constraint satisfaction search 129 (2001) Moses, M. and S. Forrest Review of The Computational Beauty of Nature by Gary William Flake (Book Review) (2001) Mosterman, P.J. and G. Biswas \ comprehensive methodology for building hybrid models of physical systems (2000) Miiller, M Partial order bounding: A new approach to evaluation in game tree search 129 (2001) Niedernostheide, F.-J., see Bode, M 130 (2001) Okamoto, Y Review of R.A. Wilson and F.C. Keil (Eds.), The MIT Encyclopedia of ihe Cognitive Sciences (Book Review) 130 (2001) Pesch, E., see Dorndorf, | 2000) 189 Peterson, D.M The mind’s new labels?: Review of R.A. Wilson and F.C Keil (Eds.), The MIT Encyclopedia of the Cognitive Sciences (Book Review) 2001) 213 Phan-Huy, T., see Dorndorf, | 2000) 189 PollackM,. E., see Horty, J.1 (2001) 199 Ramoni, M. and P. Sebastiani Robust Bayes classifiers (Research Note) 5 (2001) Régnier, P., see Cayrol, M 2001) Reid, M., see Korf, R.I 2001) Saffiotti, A., see Benferhat, S 2000) Sakama, C. and K. Inoue Prioritized logic programming and its application to common- sense reasoning (2000) Sakurai, Y., see Yokoo, M 2001) Sandewall, I M. Shanahan, Solving the Frame Problem (Book Review) 2000) Sankaranarayanan, S., see Dasgupta, P 2001) Scarcello. F.. see Gottlob. G 2000) Schaeffer, J., see Junghanns, A 2001) Schaub, T., see Delgrande, J.P. 2000) Schaub, T., see Linke, T 2000) Schreck, P., see Essert- Villard, C 2000) Schulze, H.-J., see Bode, M 2001) Sebastiani, P., see Ramoni, M 5 (2001) Selman, B., see Gomes, C.P. 2001) Seo, M., H. lida and J.W.H.M. Uiterwijk The PN*-search algorithm: Application to tsume-shogi (2001) Shanahan, M. M. Shanahan, Solving the Frame Problem (Response) 23 (2000) Sierra, B., see Inza, | 123 (2000) Skiadopoulos, S., see Koubarakis, M 123 (2000) Slaney, J. and S. Thiébaux Blocks World revisited (2001) Smets, P., see Benferhat, S. (2000) Son, T.C. and C. Baral Formalizing sensing actions \ transition function based approach (2001) 19 Staab, S. From binary temporal relations to non-binary ones and back 28 (2001) Steinberg, L. Searching stochastically generated multi-abstraction-level de- sign spaces (2001) 63 Boolean connection algebras: A new approach to the Region Connection Calculus 2 (2000) StergK.i, oseue G,en t, | 23 (2000) Stuckey. P.J., see Choi, K.M.I 123 (2000) Stumptner, M. and F. Wotawa Diagnosing tree-structured systems 127 (2001) Subrahmanian, V.S., see Dix, J 2001) Taylor | Christoph Adami, /ntroduction to ificial Life (Book Re ew ) 2001) Tennenholtz, M., see Brafman, R.1 2000) Thiébaux, S., see Slaney, J 2001) Thrun, S., D. Fox, W. Burgarandd F. Dellaert Robust Monte Carlo localization for mobile robots 2001) lorras, C., see Jiménez, P 2000) lorras, C., see Meseguer, P 2001) Trejo, R., see Baral,C 2000) Turan, G., see Horvath. 7 2 2001) Uiterwijk, J.W.H.M.. see Seo. M 2 2001) Vidal, V., see Cayrol, M 2001) Vitanyi, P., see Gao, Q 2000) Walsh, T., see Gent, I 2000) Wilson, R.A The Cognitive Sciences: A comment on 6 reviews of The MIT Encye lope dia of the Coenitive Sciences ( Response) J 2001 Wotawa, F., see Stumptner, M 2001 Yao, X., see He, J 2001 Yokoo, M., Y. Sakurai and S. Matsubara Robust combinatorial auction protocol against false-name bids 2001 Iterative state-space reduction for flexible computation 2001 Zhang, W., R. Dechter and R.E. Korf Heuristic search in artificial intelligence 2001) Zhao, F., see Bailey-Kellogg,( (2001) Zilberstein, S., see Hansen, A (2001 Zilberstein, S., see Hansen, E.A (2001 Zilberstein, S., see Horvitz. (2001 Artificial Intelligence ELSEVIER Subject Index—Volumes 121-130 earning best model granularity eaming optimal feature extraction -arning optimal hidden layer aming vector quantizer east commitment eaaSs t' -coTmremy itmI ent‘n t oprr incipic ocal Models Semantics