AI Access Foundation manages JAIR largely through the efforts of volunteers throughout the world. However, we occasionally have some small, but important, operating and infrastructure costs. We wanted to thank David Smith for his generous financial contributions to the organization, as well as Fetch Technologies, UCLA, CMU, and the University of Michigan for their ongoing support for JAIR's infrastructure. These gifts make it possible for JAIR to continue operating a freely-available journal.
JAIR is in the process of registering DOIs for future (and eventually existing) articles published in the journal. We wish to acknowledge the generous support of IJCAI, Inc. for an endowment which supports our ongoing annual costs to register DOIs.
2012 Annual Report
We are pleased to present the annual report on the status of JAIR. The report covers the activities of the journal during 2011 and the first half of 2012, as well as historical data on previous years.
Best Paper Prize Announcement
The IJCAI-JAIR Best Paper Prize is awarded to an outstanding paper published in JAIR in the preceding five calendar years. The 2012 Prize Committee selected the following paper that presents a new approach for solving problems of planning under uncertainty via their compilation into the classical planning framework. The compilation technique enables planners for problems featuring uncertainty to benefit from continual progress made in the area of classical planning. This idea has had much influence on recent work in this area and underlies current state-of-the-art planners.
The prize will be announced at the AAAI '12 awards ceremony on Tuesday morning, July 24, 2012.
2012 Prize: H. Palacios and H. Geffner (2009) "Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width", Volume 35, 623-675.
An Honorable Mention is given to the following paper which investigates nonmyopic value of information, which is a fundamental problem in many areas, including probabilistic and decision-theoretic reasoning. It provides a general treatment of the subject based on the encompassing concept of reward functions. It also provides hardness results for general graphical models, designs the first optimal and tractable algorithm for certain restricted models, and suggests new approximation techniques.
2012 Honorable Mention: A. Krause and C. Guestrin (2009) "Optimal Value of Information in Graphical Models", Volume 35, 557-591.