Sciweavers

IJCAI
2003
14 years 1 months ago
On the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar­ chy of decidable logics with multiple maximal el­ ements. It would be desirable to ...
Piero A. Bonatti
IJCAI
2003
14 years 1 months ago
A Logic For Causal Reasoning
We introduce a logical formalism of irreflexivc causal production relations that possesses both a standard monotonic semantics, and a natural nonmonotonic semantics. The formalism...
Alexander Bochman
IJCAI
2003
14 years 1 months ago
A Continuation Method for Nash Equilibria in Structured Games
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
Ben Blum, Christian R. Shelton, Daphne Koller
IJCAI
2003
14 years 1 months ago
Corpus-based, Statistical Goal Recognition
Goal recognition for dialogue systems needs to be fast, make early predictions, and be portable. We present initial work which shows that using statistical, corpus-based methods t...
Nate Blaylock, James F. Allen
IJCAI
2003
14 years 1 months ago
Comparison of Different Grid Abstractions for Pathfinding on Maps
Yngvi Björnsson, Markus Enzenberger, Robert H...
IJCAI
2003
14 years 1 months ago
Approximating Game-Theoretic Optimal Strategies for Full-scale Poker
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
Darse Billings, Neil Burch, Aaron Davidson, Robert...
IJCAI
2003
14 years 1 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
IJCAI
2003
14 years 1 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
IJCAI
2003
14 years 1 months ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...
IJCAI
2003
14 years 1 months ago
Dynamic Vehicle Routing with Stochastic Requests
This paper considers vehicle routing problems (VRP) where customer locations and service times are random variables that are realized dynamically during plan execution. It propose...
Russell Bent, Pascal Van Hentenryck