Contents
Volume 39, 2010
Planning with Noisy Probabilistic Relational Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
T. Lang, M. Toussaint
Implicit Abstraction Heuristics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
M. Katz, C. Domshlak
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks . . . . . . . . . . . . . . . . . . . . . . . . . . 127
S. Richter, M. Westphal
Cooperative Games with Overlapping Coalitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
G. Chalkiadakis, E. Elkind, E. Markakis, M. Polukarov, N. R. Jennings
Narrative Planning: Balancing Plot and Character . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217
M. O. Riedl, R. M. Young
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding . . . . . . . . . . . . . . . . . . . . 269
V. Bulitko, Y. Björnsson, R. Lawrence
A Model-Based Active Testing Approach to Sequential Diagnosis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 301
A. Feldman, G. Provan, A. van Gemund
Active Tuples-Based Scheme for Bounding Posterior Beliefs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 335
B. Bidyuk, R. Dechter, E. Rollon
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning . . 373
B. Banerjee, B. Chandrasekaran
Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity Is Your Friend! . . . . . . . . . . . . . . . . 429
S. Rudolph, B. Glimm
Kalman Temporal Differences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 483
M. Geist, O. Pietquin
Theta*: Any-Angle Path Planning on Grids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533
K. Daniel, A. Nash, S. Koenig, A. Felner
Which Clustering Do You Want? Inducing Your Ideal Clustering with Minimal Feedback . . . . . . . . . . . . . . . . 581
S. Dasgupta, V. Ng
A Utility-Theoretic Approach to Privacy in Online Services . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 633
A. Krause, E. Horvitz
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem . . . . . . . . . . . 663
Gerold Jäger, Weixiong Zhang
Best-First Heuristic Search for Multicore Machines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 689
E. Burns, S. Lemons, W. Ruml, R. Zhou
Intrusion Detection Using Continuous Time Bayesian Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 745
J. Xu, C. R. Shelton
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 775
J ournal of Artificial Intelligence Research
AN INTERNATIONAL ELECTRONIC AND PRINT JOURNAL
Editors and Staff, 2010
Editor-in-Chief
Adnan Darwiche
Associate Editor-in-Chief
Shlomo Zilberstein
Associate Editors
Chris Beck
Christian Bessiere
Michael Bowling
Ronen Brafman
Gerhard Brewka
Vincent Conitzer
Giuseppe De Giacomo
James Delgrande
Marie desJardins
Carmel Domshlak
Dieter Fox
Hector Geffner
Malte Helmert
Joerg Hoffmann
Manfred Jaeger
Thorsten Joachims
Jerome Lang
Lillian Lee
Kevin Leyton-Brown
Shaul Markovitch
Pierre Marquis
Chris Meek
Pedro Meseguer
Dragomir Radev
Jeff Rosenschein
Thomas Schiex
Dale Schuurmans
Alex Smola
Prasad Tadepalli
Sylvie Thiebaux
Gerard Verfaillie
Michael Wooldridge
Editorial Board
David Blei
Adi Botea
Olivier Buffet
Diego Calvanese
Xiaoping Chen
Yiling Chen
Yixin Chen
David Chiang
Hal Daume
Minh Binh Do
Prashant Doshi
Stefan Edelkamp
Gal Elidan
Edith Elkind
Ulle Endriss
Alan Fern
Amir Globerson
Judy Goldsmith
Eric Hansen
Paul Harrenstein
Patrik Haslum
Holger Hoos
Kristian Kersting
Roni Khardon
Dan Klein
Sebastien Konieczny
Javier Larrosa
Carsten Lutz
Ines Lynce
Felip Manya
Lluis Marquez
Petri Myllymaki
Jennifer Neville
Hwee Tou Ng
Ilkka Niemela
Bo Pang
Simon Parsons
Joelle Pineau
Pascal Poupart
Ariel Procaccia
Silja Renooij
Riccardo Rosati
Wheeler Ruml
Ashish Sabharwal
Lakhdar Sais
Torsten Schaub
Tobias Scheffer
Christian Shelton
Ben Taskar
Jennifer Wortman Vaughan
Kristen Venable
Shimon Whiteson
Jia-Huai You
Advisory Board
Rina Dechter
Oren Etzioni
Boi Faltings
Maria Fox
Russell Greiner
Adele Howe
Subbarao Kambhampati
Sven Koenig
Gerhard Lakemeyer
Fangzhen Lin
Daniel Marcu
Steven Minton
Martha Pollack
Francesca Rossi
Moshe Tennenholtz
Michael Wellman
Nevin Zhang
Toby Walsh
Dan Weld
Managing Editor
Steven Minton
Electronic Publishing Editor
Daniel Bryce
Special Projects
Toby Walsh
Production Supervisor
Lillian Bluestein
About JAIR
Subscriptions
JAIR’s editorial board is dedicated to the rapid dissemination of important
research results to the global AI community. The journal's scope encompasses all areas of artificial intelligence, including automated reasoning,
cognitive modeling, knowledge representation, learning, natural language,
neural networks, perception, and robotics. For information regarding submissions, AI Access Foundation, or the JAIR editorial charter, please see
jair.org
JAIR (ISSN 1076-975) is published three times a year by the Association for
the Advancement of Artificial Intelligence (AAAI), 445 Burgess Drive,
Suite 100 Menlo Park, CA 94025-3442, telephone (650) 328-3123. Members of AAAI receive a discount on JAIR subscriptions. The JAIR subscription price is $85.00 per volume or issue. Inquiries regarding membership
in the AAAI should be sent to the AAAI at the above address.
Microfilm, Back, or Replacement Copies
Back issues of JAIR (from volume 18 onward) are available from the Association for the Advancement of Artificial Intelligence. Send requests to
AAAI, 445 Burgess Drive, Menlo Park, California 94025. Microform copies
are available from ProQuest Information and Learning, 300 North Zeeb
Road, Ann Arbor, MI 48106. Telephone (800) 521-3044 or (734) 761-4700.
Copying Articles for Personal Use
Authorization to photocopy items for internal or personal use, or the internal or personal use of specific clients, or for educational classroom use,
is granted by AI Access Foundation. This consent does not extend to other
kinds of copying, such as for general distribution, resale, advertising, or for
creating new collective works. Please contact AAAI for such permission.
Address Change
Please notify AAAI eight weeks in advance of a change of address. Send old
label with new address to AAAI, 445 Burgess Drive, Suite 100, Menlo Park,
CA 94025-3442.
Periodicals Postage paid at Menlo Park, CA and additional mailing offices.
Postmaster: Change Service Requested. Send address changes to AAAI,
445 Burgess Drive, Suite 100, Menlo Park, CA 94025-3442.
Copyright © 2010 by AI Access Foundation and the Association for the Advancement of Artificial Intelligence. All rights reserved. No part of this
publication may be reproduced in whole or in part without prior written
permission. Unless otherwise stated, the views expressed in published material are those of the authors and do not necessarily reflect the policies or
opinions of JAIR, its editors and staff, AI Access Foundation, or the Association for the Advancement of Artificial Intelligence.
ISBN 978-1-57735-535-9