JAIR 2011

62 papers

A Logical Study of Partial Entailment Yi Zhou, Yan Zhang

A Monte-Carlo AIXI Approximation Joel Veness, Kee Siong Ng, Marcus Hutter, William T. B. Uther, David Silver

A Probabilistic Approach for Maintaining Trust Based on Evidence Yonghong Wang, Chung-Wei Hang, Munindar P. Singh

A Probabilistic Framework for Learning Kinematic Models of Articulated Objects Jürgen Sturm, Cyrill Stachniss, Wolfram Burgard

Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization Daniel Golovin, Andreas Krause

Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and H+ Jörg Hoffmann

Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects Christian Geist, Ulrich Endriss

Centrality-as-Relevance: Support Sets and Similarity as Geometric Proximity Ricardo Ribeiro, David Martins de Matos

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution Albert Atserias, Johannes Klaus Fichte, Marc Thurley

Cloning in Elections: Finding the Possible Winners Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko

Combining Evaluation Metrics via the Unanimous Improvement Ratio and Its Application to Clustering Tasks Enrique Amigó, Julio Gonzalo, Javier Artiles, Felisa Verdejo

Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling Marc J. V. Ponsen, Steven de Jong, Marc Lanctot

Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani

Controlling Complexity in Part-of-Speech Induction João Graça, Kuzman Ganchev, Luísa Coheur, Fernando Pereira, Benjamin Taskar

Decidability and Undecidability Results for Propositional Schemata Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier

Defeasible Inclusions in Low-Complexity DLs Piero A. Bonatti, Marco Faella, Luigi Sauro

Determining Possible and Necessary Winners Given Partial Orders Lirong Xia, Vincent Conitzer

Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs Matthew L. Ginsberg

Drake: An Efficient Executive for Temporal Plans with Choice Patrick R. Conrad, Brian Charles Williams

Efficient Multi-Start Strategies for Local Search Algorithms András György, Levente Kocsis

Efficient Planning Under Uncertainty with Macro-Actions Ruijie He, Emma Brunskill, Nicholas Roy

Evaluating Temporal Graphs Built from Texts via Transitive Reduction Xavier Tannier, Philippe Muller

Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference Wei Li, Pascal Poupart, Peter van Beek

False-Name Manipulations in Weighted Voting Games Haris Aziz, Yoram Bachrach, Edith Elkind, Mike Paterson

Finding Consensus Bayesian Network Structures José M. Peña

First-Order Stable Model Semantics and First-Order Loop Formulas Joohyung Lee, Yunsong Meng

From "Identical" to "Similar": Fusing Retrieved Lists Based on Inter-Document Similarities Anna Khudyak Kozorovitzky, Oren Kurland

Identifying Aspects for Web-Search Queries Fei Wu, Jayant Madhavan, Alon Y. Halevy

Interpolable Formulas in Equilibrium Logic and Answer Set Programming Dov M. Gabbay, David Pearce, Agustín Valverde

Iterated Belief Change Due to Actions and Observations Aaron Hunter, James P. Delgrande

Learning to Make Predictions in Partially Observable Environments Without a Generative Model Erik Talvitie, Satinder Singh

Making Decisions Using Sets of Probabilities: Updating, Time Consistency, and Calibration Peter D. Grünwald, Joseph Y. Halpern

MAPP: A Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees Ko-Hsin Cindy Wang, Adi Botea

Most Relevant Explanation in Bayesian Networks Changhe Yuan, Heejin Lim, Tsai-Ching Lu

Multi-Robot Adversarial Patrolling: Facing a Full-Knowledge Opponent Noa Agmon, Gal A. Kaminka, Sarit Kraus

Multiagent Learning in Large Anonymous Games Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern

Multimode Control Attacks on Elections Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra

Narrowing the Modeling Gap: A Cluster-Ranking Approach to Coreference Resolution Altaf Rahman, Vincent Ng

Non-Deterministic Policies in Markovian Decision Processes Mahdi Milani Fard, Joelle Pineau

On the Intertranslatability of Argumentation Semantics Wolfgang Dvorák, Stefan Woltran

On the Link Between Partial Meet, Kernel, and Infra Contraction and Its Application to Horn Logic Richard Booth, Thomas Andreas Meyer, Ivan Varzinczak, Renata Wassermann

On-Line Planning and Scheduling: An Application to Controlling Modular Printers Wheeler Ruml, Minh Binh Do, Rong Zhou, Markus P. J. Fromherz

Policy Invariance Under Reward Transformations for General-Sum Stochastic Games Xiaosong Lu, Howard M. Schwartz, Sidney Nascimento Givigi

Probabilistic Relational Planning with First Order Decision Diagrams Saket Joshi, Roni Khardon

Properties of Bethe Free Energies and Message Passing in Gaussian Models Botond Cseke, Tom Heskes

Redistribution Mechanisms for Assignment of Heterogeneous Objects Sujit Gujar, Y. Narahari

Regression Conformal Prediction with Nearest Neighbours Harris Papadopoulos, Vladimir Vovk, Alex Gammerman

Representing and Reasoning with Qualitative Preferences for Compositional Systems Ganesh Ram Santhanam, Samik Basu, Vasant G. Honavar

Scaling up Heuristic Planning with Relational Decision Trees Tomás de la Rosa, Sergio Jiménez Celorrio, Raquel Fuentetaja, Daniel Borrajo

Scheduling Bipartite Tournaments to Minimize Total Travel Distance Richard Hoshino, Ken-ichi Kawarabayashi

Second-Order Consistencies Christophe Lecoutre, Stéphane Cardon, Julien Vion

Sequential Diagnosis by Abstraction Sajjad Ahmed Siddiqi, Jinbo Huang

Soft Constraints of Difference and Equality Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon

Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintveld, Vincent Conitzer, Milind Tambe

Stochastic Enforced Hill-Climbing Jia-Hong Wu, Rajesh Kalyanam, Robert Givan

The Complexity of Integer Bound Propagation Lucas Bordeaux, George Katsirelos, Nina Narodytska, Moshe Y. Vardi

The Opposite of Smoothing: A Language Model Approach to Ranking Query-Specific Document Clusters Oren Kurland, Eyal Krikon

Theoretical and Practical Foundations of Large-Scale Agent-Based Micro-Storage in the Smart Grid Perukrishnen Vytelingum, Thomas Voice, Sarvapali D. Ramchurn, Alex Rogers, Nicholas R. Jennings

Topological Value Iteration Algorithms Peng Dai, Mausam, Daniel S. Weld, Judy Goldsmith

Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates Mario Alviano, Francesco Calimeri, Wolfgang Faber, Nicola Leone, Simona Perri

Value of Information Lattice: Exploiting Probabilistic Independence for Effective Feature Subset Acquisition Mustafa Bilgic, Lise Getoor

Where Are the Hard Manipulation Problems? Toby Walsh