Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams
CL '00 Proceedings of the First International Conference on Computational Logic
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
State-set branching: Leveraging BDDs for heuristic search
Artificial Intelligence
Limits and Possibilities of BDDs in State Space Search
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
Domain-independent structured duplicate detection
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
New admissible heuristics for domain-independent planning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
Loosely coupled formulations for automated planning: an integer programming perspective
Journal of Artificial Intelligence Research
Reducing accidental complexity in planning problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Domain-independent, automatic partitioning for probabilistic planning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Optimal symbolic planning with action costs and preferences
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Friends or foes? on planning as satisfiability and abstract CNF encodings
Journal of Artificial Intelligence Research
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
Instantiating general games using prolog or dependency graphs
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Analyzing search topology without running any search: on the connection between causal graphs and h+
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |