JAIR 2009

52 papers

A Bilinear Programming Approach for Multiagent Planning Marek Petrik, Shlomo Zilberstein

A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains Nicolas Meuleau, Emmanuel Benazera, Ronen I. Brafman, Eric A. Hansen, Mausam

An Anytime Algorithm for Optimal Coalition Structure Generation Talal Rahwan, Sarvapali D. Ramchurn, Nicholas R. Jennings, Andrea Giovannucci

Approximate Strong Equilibrium in Job Scheduling Games Michal Feldman, Tami Tamir

Asynchronous Forward Bounding for Distributed COPs Amir Gershman, Amnon Meisels, Roie Zivan

Automated Reasoning in Modal and Description Logics via SAT Encoding: The Case Study of K(m)/ALC-Satisfiability Roberto Sebastiani, Michele Vescovi

Behavior Bounding: An Efficient Method for High-Level Behavior Comparison Scott A. Wallace

Bounds Arc Consistency for Weighted CSPs Matthias Zytnicki, Christine Gaspin, Simon de Givry, Thomas Schiex

Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width Héctor Palacios, Hector Geffner

Complex Question Answering: Unsupervised Learning Approaches and Experiments Yllias Chali, Shafiq R. Joty, Sadid A. Hasan

Conservative Inference Rule for Uncertain Reasoning Under Incompleteness Marco Zaffalon, Enrique Miranda

Content Modeling Using Latent Permutations Harr Chen, S. R. K. Branavan, Regina Barzilay, David R. Karger

Cross-Lingual Annotation Projection for Semantic Roles Sebastian Padó, Mirella Lapata

Efficient Informative Sensing Using Multiple Robots Amarjeet Singh, Andreas Krause, Carlos Guestrin, William J. Kaiser

Efficient Markov Network Structure Discovery Using Independence Tests Facundo Bromberg, Dimitris Margaritis, Vasant G. Honavar

Eliciting Single-Peaked Preferences Using Comparison Queries Vincent Conitzer

Enhancing QA Systems with Complex Temporal Question Processing Capabilities Estela Saquete, José Luis Vicedo González, Patricio Martínez-Barco, Rafael Muñoz, Hector Llorens

Exploiting Single-Cycle Symmetries in Continuous Constraint Problems Vicente Ruiz de Angulo, Carme Torras

Friends or Foes? on Planning as Satisfiability and Abstract CNF Encodings Carmel Domshlak, Jörg Hoffmann, Ashish Sabharwal

Generic Preferences over Subsets of Structured Objects Maxim Binshtok, Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony

How Hard Is Bribery in Elections? Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra

Hypertableau Reasoning for Description Logics Boris Motik, Robert D. C. Shearer, Ian Horrocks

Identification of Pleonastic It Using the Web Yifan Li, Petr Musílek, Marek Z. Reformat, Loren Wyard-Scott

Inferring Shallow-Transfer Machine Translation Rules from Small Parallel Corpora Felipe Sánchez-Martínez, Mikel L. Forcada

Interactive Policy Learning Through Confidence-Based Autonomy Sonia Chernova, Manuela M. Veloso

Learning Bayesian Network Equivalence Classes with Ant Colony Optimization Rónán Daly, Qiang Shen

Learning Document-Level Semantic Properties from Free-Text Annotations S. R. K. Branavan, Harr Chen, Jacob Eisenstein, Regina Barzilay

Llull and Copeland Voting Computationally Resist Bribery and Constructive Control Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe

Mechanisms for Making Crowds Truthful Radu Jurca, Boi Faltings

Message-Based Web Service Composition, Integrity Constraints, and Planning Under Uncertainty: A New Connection Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert, Marco Pistore

Modularity Aspects of Disjunctive Stable Models Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran

Monte Carlo Sampling Methods for Approximating Interactive POMDPs Prashant Doshi, Piotr J. Gmytrasiewicz

Multilingual Part-of-Speech Tagging: Two Unsupervised Approaches Tahira Naseem, Benjamin Snyder, Jacob Eisenstein, Regina Barzilay

Optimal Value of Information in Graphical Models Andreas Krause, Carlos Guestrin

ParamILS: An Automatic Algorithm Configuration Framework Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown, Thomas Stützle

Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard Omer Giménez, Anders Jonsson

Policy Iteration for Decentralized Control of Markov Decision Processes Daniel S. Bernstein, Christopher Amato, Eric A. Hansen, Shlomo Zilberstein

Prime Implicates and Prime Implicants: From Propositional to Modal Logic Meghyn Bienvenu

Relaxed Survey Propagation for the Weighted Maximum Satisfiability Problem Hai Leong Chieu, Wee Sun Lee

RoxyBot-06: Stochastic Prediction and Optimization in TAC Travel Amy Greenwald, Seong Jae Lee, Victor Naroditskiy

Sentence Compression as Tree Transduction Trevor Cohn, Mirella Lapata

Soft Goals Can Be Compiled Away Emil Keyder, Hector Geffner

Solving #SAT and Bayesian Inference with Backtracking Search Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi

Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms José E. Gallardo, Carlos Cotta, Antonio J. Fernández

The Complexity of Circumscription in DLs Piero A. Bonatti, Carsten Lutz, Frank Wolter

The DL-Lite Family and Relations Alessandro Artale, Diego Calvanese, Roman Kontchakov, Michael Zakharyaschev

The Role of Macros in Tractable Planning Anders Jonsson

Transductive Rademacher Complexity and Its Applications Ran El-Yaniv, Dmitry Pechyony

Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty Sarvapali D. Ramchurn, Claudio Mezzetti, Andrea Giovannucci, Juan A. Rodríguez-Aguilar, Rajdeep K. Dash, Nicholas R. Jennings

Unsupervised Methods for Determining Object and Relation Synonyms on the Web Alexander Yates, Oren Etzioni

Variable Forgetting in Reasoning About Knowledge Kaile Su, Abdul Sattar, Guanfeng Lv, Yan Zhang

Wikipedia-Based Semantic Interpretation for Natural Language Processing Evgeniy Gabrilovich, Shaul Markovitch