Sciweavers

JAIR
2008
103views more  JAIR 2008»
13 years 11 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
JAIR
2008
78views more  JAIR 2008»
13 years 11 months ago
Analogical Dissimilarity: Definition, Algorithms and Two Experiments in Machine Learning
Laurent Miclet, Sabri Bayoudh, Arnaud Delhay
JAIR
2008
120views more  JAIR 2008»
13 years 11 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras
JAIR
2008
109views more  JAIR 2008»
13 years 11 months ago
Modular Reuse of Ontologies: Theory and Practice
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
JAIR
2008
98views more  JAIR 2008»
13 years 11 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
JAIR
2008
107views more  JAIR 2008»
13 years 11 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld
JAIR
2008
99views more  JAIR 2008»
13 years 11 months ago
The Complexity of Planning Problems With Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson
JAIR
2008
107views more  JAIR 2008»
13 years 11 months ago
Exploiting Subgraph Structure in Multi-Robot Path Planning
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
Malcolm Ross Kinsella Ryan
JAIR
2008
164views more  JAIR 2008»
13 years 11 months ago
Gesture Salience as a Hidden Variable for Coreference Resolution and Keyframe Extraction
Gesture is a non-verbal modality that can contribute crucial information to the understanding of natural language. But not all gestures are informative, and non-communicative hand...
Jacob Eisenstein, Regina Barzilay, Randall Davis
JAIR
2008
130views more  JAIR 2008»
13 years 11 months ago
Axiomatic Foundations for Ranking Systems
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent ...
Alon Altman, Moshe Tennenholtz