JAIR 2012

52 papers

A Market-Inspired Approach for Intersection Management in Urban Road Traffic Networks Matteo Vasirani, Sascha Ossowski

A New Look at BDDs for Pseudo-Boolean Constraints Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Valentin Mayer-Eichberger

A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing Alexander M. Rush, Michael Collins

Algorithms and Limits for Compact Plan Representations Christer Bäckström, Peter Jonsson

Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures Priyankar Ghosh, Amit Sharma, P. P. Chakrabarti, Pallab Dasgupta

An Approximative Inference Method for Solving ∃∀SO Satisfiability Problems Hanne Vlaeminck, Joost Vennekens, Marc Denecker, Maurice Bruynooghe

Avoiding and Escaping Depressions in Real-Time Heuristic Search Carlos Hernández, Jorge A. Baier

Coalition Structure Generation over Graphs Thomas Voice, Maria Polukarov, Nicholas R. Jennings

COLIN: Planning with Continuous Linear Numeric Change Amanda Jane Coles, Andrew Coles, Maria Fox, Derek Long

Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos, Ian Horrocks

Complexity of Judgment Aggregation Ulle Endriss, Umberto Grandi, Daniele Porello

Computing All-Pairs Shortest Paths by Leveraging Low Treewidth Léon Planken, Mathijs de Weerdt, Roman van der Krogt

Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction Jimmy Ho-Man Lee, Ka Lun Leung

Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems Gilles Pesant, Claude-Guy Quimper, Alessandro Zanarini

Domain and Function: A Dual-Space Model of Semantic Relations and Compositions Peter D. Turney

Evaluating Indirect Strategies for Chinese-Spanish Statistical Machine Translation Marta R. Costa-jussà, A. Q. Carlos Henríquez, Rafael E. Banchs

Exploiting Model Equivalences for Solving Interactive Dynamic Influence Diagrams Yifeng Zeng, Prashant Doshi

Generalized Biwords for Bitext Compression and Translation Spotting Felipe Sánchez-Martínez, Rafael C. Carrasco, Miguel A. Martínez-Prieto, Joaquín Adiego

Generating Approximate Solutions to the TTP Using a Linear Distance Relaxation Richard Hoshino, Ken-ichi Kawarabayashi

Improving Statistical Machine Translation for a Resource-Poor Language Using Related Resource-Rich Languages Preslav Nakov, Hwee Tou Ng

Interactions Between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results Francesco Belardinelli, Alessio Lomuscio

Irrelevant and Independent Natural Extension for Sets of Desirable Gambles Gert de Cooman, Enrique Miranda

Learning and Reasoning with Action-Related Places for Robust Mobile Manipulation Freek Stulp, Andreas Fedrizzi, Lorenz Mösenlechner, Michael Beetz

Learning to Predict from Textual Data Kira Radinsky, Sagie Davidovich, Shaul Markovitch

Learning to Win by Reading Manuals in a Monte-Carlo Framework S. R. K. Branavan, David Silver, Regina Barzilay

Local Consistency and SAT-Solvers Peter Jeavons, Justyna Petke

Location-Based Reasoning About Complex Multi-Agent Behavior Adam Sadilek, Henry A. Kautz

Modeling Social Causality and Responsibility Judgment in Multi-Agent Interactions Wenji Mao, Jonathan Gratch

Modelling Observation Correlations for Active Exploration and Robust Object Detection Javier Vélez, Garrett Hemann, Albert S. Huang, Ingmar Posner, Nicholas Roy

Narrative Planning: Compilations to Classical Planning Patrik Haslum

Online Speedup Learning for Optimal Planning Carmel Domshlak, Erez Karpas, Shaul Markovitch

Plan-Based Policies for Efficient Multiple Battery Load Management Maria Fox, Derek Long, Daniele Magazzeni

Proximity-Based Non-Uniform Abstractions for Approximate Planning Jiri Baum, Ann E. Nicholson, Trevor I. Dix

Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach Bernardo Cuenca Grau, Boris Motik

Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming Joohyung Lee, Ravi Palla

Removing Redundant Messages in N-Ary BnB-ADOPT Patricia Gutierrez, Pedro Meseguer

Replanning in Domains with Partial Information and Sensing Actions Ronen I. Brafman, Guy Shani

Riffled Independence for Efficient Inference with Partial Rankings Jonathan Huang, Ashish Kapoor, Carlos Guestrin

Robust Local Search for Solving RCPSP/max with Durational Uncertainty Na Fu, Hoong Chuin Lau, Pradeep Varakantham, Fei Xiao

Safe Exploration of State and Action Spaces in Reinforcement Learning Javier García, Fernando Fernández

SAP Speaks PDDL: Exploiting a Software-Engineering Model for Planning in Business Process Management Jörg Hoffmann, Ingo Weber, Frank Michael Kraft

SAS+ Planning as Satisfiability Ruoyun Huang, Yixin Chen, Weixiong Zhang

Semantic Similarity Measures Applied to an Ontology for Human-like Interaction Esperanza Albacete, Javier Calle-Gómez, Elena Castro, Dolores Cuadra

Solving Limited Memory Influence Diagrams Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon

The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary Tiziano Flati, Roberto Navigli

The Logical Difference for the Lightweight Description Logic EL Boris Konev, Michel Ludwig, Dirk Walther, Frank Wolter

The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces Hang Dinh, Hieu T. Dinh, Laurent Michel, Alexander Russell

The Tractability of CSP Classes Defined by Forbidden Patterns David A. Cohen, Martin C. Cooper, Páidí Creed, Dániel Marx, András Z. Salamon

Towards Unsupervised Learning of Temporal Relations Between Events Seyed Abolghasem Mirroshandel, Gholamreza Ghassem-Sani

Tractable Set Constraints Manuel Bodirsky, Martin Hils

Tractable Triangles and Cross-Free Convexity in Discrete Optimisation Martin C. Cooper, Stanislav Zivný

Transforming Graph Data for Statistical Relational Learning Ryan A. Rossi, Luke K. McDowell, David William Aha, Jennifer Neville