Artificial Intelligence and Automation References 267
14.16 J. Pearl, S. Russell: Bayesian networks. In: Hand-
book of Brain Theory and Neural Networks,ed.by
M.A. Arbib (MIT Press, Cambridge 2003) pp. 157–160
14.17 J. Pearl: Probabilistic Reasoning in Intelligent Sys-
tems: Networks of Plausible Inference (Morgan
Kaufmann, San Fransisco 1988)
14.18 M. Sahami, S. Dumais, D. Heckerman, E. Horvitz:
A bayesian approach to filtering junk e-Mail. In:
Learning for Text Categorization: Papers from the
1998 Workshop AAAI Technical Report WS-98-05
(Madison 1998)
14.19 J.A. Zdziarski: Ending Spam: Bayesian Content
Filtering and the Art of Statistical Language Clas-
sification (No Starch, San Francisco 2005)
14.20 D. Quinlan: BayesInSpamAssassin, http://wiki.
apache.org/spamassassin/BayesInSpamAssassin
(2005)
14.21 K.M. Hanson: Introduction to bayesian image
analysis. In: Medical Imaging: Image Processing,
Vol. 1898, ed. by M.H. Loew, (Proc. SPIE, 1993)
pp. 716–732
14.22 L. Denoyer, P. Gallinari: Bayesian network model
for semistructured document classification, Inf.
Process. Manage. 40,807–827(2004)
14.23 S. Fox, K. Karnawat, M. Mydland, S. Dumais,
T. White: Evaluating implicit measures to improve
web search, ACM Trans. Inf. Syst. 23(2), 147–168
(2005)
14.24 L. Zadeh, G.J. Klir, Bo Yuan: Fuzzy Sets, Fuzzy Logic,
and Fuzzy Systems: Selected Papers by Lotfi Zadeh
(World Scientific, River Edge 1996)
14.25 G.J.Klir,U.S.Clair,B.Yuan:Fuzzy Set Theory: Foun-
dations and Applications (Prentice Hall, Englewood
Cliffs 1997)
14.26 A. Tate: Planning. In: MIT Encyclopedia of the Cog-
nitive Sciences, (1999) pp. 652–653
14.27 T. Estlin, R. Castano, B. Anderson, D. Gaines,
F. Fisher, M. Judd: Learning and planning for Mars
rover science, Proc. Int. Joint Conf. Artif. Intell.
(IJCAI) (2003)
14.28 S.K. Gupta, D.A. Bourne, K. Kim, S.S. Krishanan:
Automated process planning for sheet metal bend-
ing operations, J. Manuf. Syst. 17(5), 338–360 (1998)
14.29 A. Gerevini, D. Long: Plan constraints and pref-
erences in pddl3: The language of the fifth
international planning competition. Technical Re-
port (University of Brescia, 2005), available at
http://cs-www.cs.yale.edu/homes/dvm/papers/
pddl-ipc5.pdf
14.30 A.L. Blum, M.L. Furst: Fast planning through plan-
ning graph analysis, Proc. Int. Joint Conf. Artif.
Intell. (IJCAI) (1995) pp. 1636–1642
14.31 A. Tate, B. Drabble, R. Kirby: O-Plan2: An Architec-
ture for Command, Planning and Control (Morgan
Kaufmann, San Francisco 1994)
14.32 D.E. Wilkins: Practical Planning: Extending the
Classical AI Planning Paradigm (Morgan Kauf-
mann, San Mateo 1988)
14.33
D. Nau, T.-C. Au, O. Ilghami, U. Kuter, J.W. Murdock,
D. Wu, F. Yaman: SHOP2: An HTN planning system,
J. Artif. Intell. Res. 20, 379–404 (2003)
14.34 F. Bacchus, F. Kabanza: Using temporal logics to
express search control knowledge for planning,
Artif. Intell. 116(1/2), 123–191 (2000)
14.35 J. Kvarnström, P. Doherty: TALplanner: A temporal
logic based forward chaining planner, Ann. Math.
Artif. Intell. 30, 119–169 (2001)
14.36 M. Fox, D. E. Smith: Special track on the 4th
international planning competition. J. Artif. In-
tell. Res. (2006), available at http://www.jair.org/
specialtrack.html
14.37 B. Bonet, H. Geffner: Labeled RTDP: Improving the
convergence of real-time dynamic programming,
Proc. 13th Int. Conf. Autom. Plan. Sched. (ICAPS)
(AAAI, 2003), pp 12–21
14.38 D. Nau, T.-C. Au, O. Ilghami, U. Kuter, H. Mu
˜
noz-
Avila, J.W. Murdock, D. Wu, F. Yaman: Applications
of SHOP and SHOP2, IEEE Intell. Syst. 20(2), 34–41
(2005)
14.39 M. Boddy, J. Gohde, J.T. Haigh, S. Harp: Course of
action generation for cyber security using classical
planning, Proc. 15th Int. Conf. Autom. Plan. Sched.
(ICAPS) (2005)
14.40 M. Ghallab, D. Nau, P. Traverso: Automated Plan-
ning: Theory and Practice (Morgan Kaufmann, San
Francisco 2004)
14.41 S.M. Lavalle: Planning Algorithms (Cambridge Uni-
versity Press, Cambridge 2006)
14.42 J. Schaeffer, N. Burch, Y. Björnsson, A. Kishimoto,
M. Müller, R. Lake, P. Lu, S. Sutphen: Checkers is
solved, Science 317(5844), 1518–1522 (2007)
14.43 D.E. Knuth, R.W. Moore: An analysis of alpha-beta
pruning, Artif. Intell. 6, 293–326 (1975)
14.44 G. Tesauro: Programming Backgammon Using
Self-Teaching Neural Nets (Elsevier, Essex 2002)
14.45 S.J.J. Smith, D.S. Nau, T. Throop: Computer bridge:
A big win for AI planning, AI Mag. 19(2), 93–105
(1998)
14.46 M. Harris: Laak-Eslami team defeats Polaris in
man-machine poker championship, Poker News
(2007), Available at www.pokernews.
com/news/2007/7/laak-eslami-team-defeats-
polaris-man-machine-poker-championship.htm
14.47 A. Parker, D. Nau, V.S. Subrahmanian: Over-
confidence or paranoia? Search in imperfect-
information games, Proc. Natl. Conf. Artif. Intell.
(AAAI) (2006)
14.48 D. Billings: Thoughts on RoShamBo, Int. Comput.
Games Assoc. J. 23(1), 3–8 (2000)
14.49 B. Johanson: Robust strategies and counter-
strategies: Building a champion level computer
poker player. Master Thesis (University of Alberta,
2007)
14.50 S. Hart, R.J. Aumann (Eds.): Handbook of Game
Theory with Economic Applications 2 (North Hol-
land, Amsterdam 1994)
Part B 14