Sciweavers

60 search results - page 2 / 12
» Stochastic Planning with First Order Decision Diagrams
Sort
View
AAAI
2008
13 years 8 months ago
Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent fragment of the Web Ontology Language OWL. The algorithm is based on ordered bi...
Sebastian Rudolph, Markus Krötzsch, Pascal Hi...
IJCAI
2001
13 years 7 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
AIPS
2003
13 years 7 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
AAAI
2008
13 years 8 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann
JAIR
2006
120views more  JAIR 2006»
13 years 5 months ago
FluCaP: A Heuristic Search Planner for First-Order MDPs
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
Steffen Hölldobler, Eldar Karabaev, Olga Skvo...