JAIR Volume 50 (2014)
Craig Boutilier, Editor in Chief
7 x 10, 978 pp., references, index, illus., $100.00 softcover, ISBN 978-1-57735-728-5
Contents
Topic-Based Dissimilarity and Sensitivity Models for Translation Rule Selection / 1
Min Zhang, Xinyan Xiao, Deyi Xiong, Qun Liu
Knowledge Forgetting in Answer Set Programming / 31
Yisong Wang, Yan Zhang, Yi Zhou, Mingyi Zhang
A Decision-Theoretic Model of Assistance / 71
Alan Fern, Sriraam Natarajan, Kshitij Judah, Prasad Tadepalli
Finding Optimal Solutions for Voting Game Design Problems / 105
Bart de Keijzer, Tomas B. Klos, Yingqian Zhang
Enhanced Partial Expansion A* / 141
Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan Sturtevant, Robert C. Holte, Jonathan Schaeffer
An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models / 189
Jasper De Bock, Gert de Cooman
Reconnection with the Ideal Tree: A New Approach to Real-Time Search / 235
Nicolás Rivera, León Illanes, Jorge A. Baier, Carlos Hernández
Property Directed Reachability for Automated Planning / 265
Martin Suda
Game-Theoretic Security Patrolling with Dynamic Execution Uncertainty and a Case Study on a Real Transit System / 321
Francesco M. Delle Fave, Albert Xin Jiang, Zhengyu Yin, Chao Zhang, Milind Tambe, Sarit Kraus, John P. Sullivan
HC-Search: A Learning Framework for Search-Based Structured Prediction / 369
Janardhan Rao Doppa, Alan Fern, Prasad Tadepalli
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda / 409
Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondřej Suchý, Gerhard J. Woeginger
Monotone Temporal Planning: Tractability, Extensions and Applications / 447
Martin C. Cooper, Frédéric Maris, Pierre Régnier
Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions / 487
Emil Keyder, Jörg Hoffmann, Patrik Haslum
Integrating Queueing Theory and Scheduling for Dynamic Scheduling Problems / 535
Daria Terekhov, Tony T. Tran, Douglas G. Down, J. Christopher Beck
False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time / 573
Anja Rey, Jörg Rothe
Probabilistic Inference in Credal Networks: New Complexity Results / 603
Denis Deratani Mauá, Cassio Polpo de Campos, Alessio Benavoli, Alessandro Antonucci
Planning through Automatic Portfolio Configuration: The PbP Approach / 639
Alfonso Emilio Gerevini, Alessandro Saetti, Mauro Vallati
MDD Propagation for Sequence Constraints / 697
David Bergman, Andre A. Cire, Willem-Jan van Hoeve
Sentiment Analysis of Short Informal Texts / 723
Svetlana Kiritchenko, Xiaodan Zhu, Saif M. Mohammad
Policy Iteration Based on Stochastic Factorization / 763
André M. S. Barreto, Joelle Pineau, Doina Precup
Speeding Up Iterative Ontology Alignment Using Block-Coordinate Descent / 805
Uthayasanker Thayasivam, Prashant Doshi
Arbitration and Stability in Cooperative Games with Overlapping Coalitions / 847
Yair Zick, Evangelos Markakis, Edith Elkind
Demand Side Energy Management via Multiagent Coordination in Consumer Cooperatives / 885
Andreas Veit, Ying Xu, Ronghuo Zheng, Nilanjan Chakraborty, Katia Sycara
Belief Tracking for Planning with Sensing: Width, Complexity and Approximations / 923
Blai Bonet, Hector Geffner
Index / 971