Journal of Artificial Intelligence Research
Volume Thirty-Five
Please Note: To view the abstract of a given article, select the link that is activated by the article title. The abstract will appear in a separate browser window. Full text of a given article can be selected in a similar manner from the link activitated by the title in the abstract window. (Most, but not all abstracts will link to full text.) PDF file sizes may be large!
This journal is also available in book and CD format.
Contents
Issue 1
Complex Question Answering: Unsupervised Learning Approaches and Experiments / 1
Y. Chali, S. R. Joty, and S. A. Hasan
Message-Based Web Service Composition, Integrity Constraints, and
Planning under Uncertainty: A New Connection / 49
J. Hoffmann, P. Bertoli, M. Helmert, and M. Pistore
Trust-Based Mechanisms for Robust and Efficient Task Allocation in the
Presence of Execution Uncertainty / 119
S. D. Ramchurn, C. Mezzetti, A. Giovannucci, J. A. Rodriguez-Aguilar, R. K. Dash, and N. R. Jennings
Eliciting Single-Peaked Preferences Using Comparison Queries / 161
V. Conitzer
Transductive Rademacher Complexity and its Applications / 193
R. El-Yaniv and D. Pechyony
A Bilinear Programming Approach for Multiagent Planning / 235
M. Petrik and S. Zilberstein
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control / 275
P. Faliszewski, E. Hemaspaandra, L. A. Hemaspaandra, and J. Rothe
Automated Reasoning in Modal and Description Logics via SAT Encoding: The Case Study of Km/ALC-Satisfiability / 343
R. Sebastiani and M. Vescovi
Learning Bayesian Network Equivalence Classes with Ant Colony Optimization / 391
R. Daly and Q. Shen
Issue 2
Efficient Markov Network Structure Discovery Using Independence Tests / 449
F. Bromberg, D. Margaritis, and V. Honavar
How Hard Is Bribery in Elections? / 485
P. Faliszewski, E. Hemaspaandra, and L. A. Hemaspaandra
Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms / 533
J. E. Gallardo, C. Cotta, and A. J. Fernández
Optimal Value of Information in Graphical Models / 557
A. Krause and C. Guestrin
Bounds Arc Consistency for Weighted CSPs / 593
M. Zytnicki, C. Gaspin, S. de Givry, and T. Schiex
Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width / 623
H. Palacios and H. Geffner
Variable Forgetting in Reasoning about Knowledge / 677
K. Su, A. Sattar, G. Lv, and Y. Zhang
The Complexity of Circumscription in Description Logic / 717
P. A. Bonatti, C. Lutz, F. Wolter
Enhancing QA Systems with Complex Temporal Question Processing Capabilities / 775
E. Saquete, J. Luis Vicedo, P. Martínez-Barco, R. Muñoz, and H. Llorens
Modularity Aspects of Disjunctive Stable Models / 813
T. Janhunen, E. Oikarinen, H. Tompits, and S. Woltran
Index / 823
AAAI Digital Library
AAAI relies on your generous support through membership and donations. If you find these resources useful, we would be grateful for your support.