JAIR Volume 42 Articles
Each entry in this table of contents provides links to an individual article and its appendices (if any):
T. Walsh (2011) "Where Are the Hard Manipulation Problems?", Volume 42, pages 1-29
R. Booth, T. Meyer, I. Varzinczak and R. Wassermann (2011) "On the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic", Volume 42, pages 31-53
K. C. Wang and A. Botea (2011) "MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees", Volume 42, pages 55-90
R. Hoshino and K. Kawarabayashi (2011) "Scheduling Bipartite Tournaments to Minimize Total Travel Distance", Volume 42, pages 91-124
J. Lee and Y. Meng (2011) "First-Order Stable Model Semantics and First-Order Loop Formulas", Volume 42, pages 125-180
P. Dai, Mausam , D. S. Weld and J. Goldsmith (2011) "Topological Value Iteration Algorithms", Volume 42, pages 181-209
G. R. Santhanam, S. Basu and V. Honavar (2011) "Representing and Reasoning with Qualitative Preferences for Compositional Systems", Volume 42, pages 211-274
R. Ribeiro and D. Martins de Matos (2011) "Centrality-as-Relevance: Support Sets and Similarity as Geometric Proximity", Volume 42, pages 275-308
C. Yuan, H. Lim and T. Lu (2011) "Most Relevant Explanation in Bayesian Networks", Volume 42, pages 309-352
E. Talvitie and S. Singh (2011) "Learning to Make Predictions In Partially Observable Environments Without a Generative Model", Volume 42, pages 353-392
P. D. Grunwald and J. Y. Halpern (2011) "Making Decisions Using Sets of Probabilities: Updating, Time Consistency, and Calibration", Volume 42, pages 393-426
D. Golovin and A. Krause (2011) "Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization", Volume 42, pages 427-486
2013 IJCAI-JAIR Best Paper
M. Alviano, F. Calimeri, W. Faber, N. Leone and S. Perri (2011) "Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates ", Volume 42, pages 487-527
E. Elkind, P. Faliszewski and A. Slinko (2011) "Cloning in Elections: Finding the Possible Winners", Volume 42, pages 529-573
M. Ponsen, S. de Jong and M. Lanctot (2011) "Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling", Volume 42, pages 575-605
P. R. Conrad and B. C. Williams (2011) "Drake: An Efficient Executive for Temporal Plans with Choice", Volume 42, pages 607-659
J. M. Peña (2011) "Finding Consensus Bayesian Network Structures", Volume 42, pages 661-687
E. Amigó, J. Gonzalo, J. Artiles and F. Verdejo (2011) "Combining Evaluation Metrics via the Unanimous Improvement Ratio and its Application to Clustering Tasks", Volume 42, pages 689-718
P. A. Bonatti, M. Faella and L. Sauro (2011) "Defeasible Inclusions in Low-Complexity DLs", Volume 42, pages 719-764
P. Vytelingum, T. D. Voice, S. D. Ramchurn, A. Rogers and N. R. Jennings (2011) "Theoretical and Practical Foundations of Large-Scale Agent-Based Micro-Storage in the Smart Grid", Volume 42, pages 765-813
AAMAS 2010 iRobot Best Paper Award, Honorable Mention for the 2016 IJCAI-JAIR Best Paper Prize
J. Wu, R. Kalyanam and R. Givan (2011) "Stochastic Enforced Hill-Climbing", Volume 42, pages 815-850
Abstract | PDF | PostScript | doi:10.1613/jair.3420
Appendix 1 - Per-problem results | Appendix 2 - Additionally generated problems used in the evaluation | Appendix 3 - Details of omitted problems
M. L. Ginsberg (2011) "Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs", Volume 42, pages 851-886
N. Agmon, G. A. Kaminka and S. Kraus (2011) "Multi-Robot Adversarial Patrolling: Facing a Full-Knowledge Opponent", Volume 42, pages 887-916
D. Gabbay, D. Pearce and A. Valverde (2011) "Interpolable Formulas in Equilibrium Logic and Answer Set Programming", Volume 42, pages 917-943
