JAIR Volume 35 Articles
Each entry in this table of contents provides links to an individual article and its appendices (if any):
Y. Chali, S. R. Joty and S. A. Hasan (2009) "Complex Question Answering: Unsupervised Learning Approaches and Experiments", Volume 35, pages 1-47
J. Hoffmann, P. Bertoli, M. Helmert and M. Pistore (2009) "Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection", Volume 35, pages 49-117
S. D. Ramchurn, C. Mezzetti, A. Giovannucci, J. A. Rodriguez-Aguilar, R. K. Dash and N. R. Jennings (2009) "Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty", Volume 35, pages 119-159
V. Conitzer (2009) "Eliciting Single-Peaked Preferences Using Comparison Queries", Volume 35, pages 161-191
R. El-Yaniv and D. Pechyony (2009) "Transductive Rademacher Complexity and its Applications", Volume 35, pages 193-234
M. Petrik and S. Zilberstein (2009) "A Bilinear Programming Approach for Multiagent Planning", Volume 35, pages 235-274
P. Faliszewski, E. Hemaspaandra, L. A. Hemaspaandra and J. Rothe (2009) "Llull and Copeland Voting Computationally Resist Bribery and Constructive Control", Volume 35, pages 275-341
R. Sebastiani and M. Vescovi (2009) "Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability", Volume 35, pages 343-389
R. Daly and Q. Shen (2009) "Learning Bayesian Network Equivalence Classes with Ant Colony Optimization", Volume 35, pages 391-447
F. Bromberg, D. Margaritis and V. Honavar (2009) "Efficient Markov Network Structure Discovery Using Independence Tests", Volume 35, pages 449-484
P. Faliszewski, E. Hemaspaandra and L. A. Hemaspaandra (2009) "How Hard Is Bribery in Elections?", Volume 35, pages 485-532
J. E. Gallardo, C. Cotta and A. J. Fernández (2009) "Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms", Volume 35, pages 533-555
A. Krause and C. Guestrin (2009) "Optimal Value of Information in Graphical Models", Volume 35, pages 557-591
Honorable Mention for the 2012 IJCAI-JAIR Best Paper Prize
Abstract | PDF | PostScript | doi:10.1613/jair.2737
Appendix 1 - Erratum | Appendix 2 - Original Version
M. Zytnicki, C. Gaspin, S. de Givry and T. Schiex (2009) "Bounds Arc Consistency for Weighted CSPs", Volume 35, pages 593-621
H. Palacios and H. Geffner (2009) "Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width", Volume 35, pages 623-675
2012 IJCAI-JAIR Best Paper Prize
K. Su, A. Sattar, G. Lv and Y. Zhang (2009) "Variable Forgetting in Reasoning about Knowledge", Volume 35, pages 677-716
P. A. Bonatti, C. Lutz and F. Wolter (2009) "The Complexity of Circumscription in DLs", Volume 35, pages 717-773
E. Saquete, J. Luis Vicedo, P. Martínez-Barco, R. Muñoz and H. Llorens (2009) "Enhancing QA Systems with Complex Temporal Question Processing Capabilities", Volume 35, pages 775-811
T. Janhunen, E. Oikarinen, H. Tompits and S. Woltran (2009) "Modularity Aspects of Disjunctive Stable Models", Volume 35, pages 813-857
