Sciweavers

4894 search results - page 78 / 979
» Dynamic Abstraction Planning
Sort
View
JOLLI
2010
78views more  JOLLI 2010»
14 years 8 months ago
On the Membership Problem for Non-Linear Abstract Categorial Grammars
embership problem for non-linear Abstract Categorial Grammars Sylvain Salvati Abstract In this paper we show that the membership problem for second order nonbstract Categorial Gram...
Sylvain Salvati
AAAI
2010
14 years 11 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
JAIR
2008
107views more  JAIR 2008»
14 years 10 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
ARGMAS
2009
Springer
15 years 4 months ago
A Generative Dialogue System for Arguing about Plans in Situation Calculus
Abstract. This paper presents an argumentation mechanism for reconciling conflicts between planning agents related to plan proposals, which are caused by inconsistencies between b...
Alexandros Belesiotis, Michael Rovatsos, Iyad Rahw...
FROCOS
2000
Springer
15 years 1 months ago
Non-Trivial Symbolic Computations in Proof Planning
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
Volker Sorge