4595 search results - page 127 / 919 » Reasoning about Plans |
204
click to vote
AIPS
2006
15 years 8 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
208
click to vote
CLIMA
2004
15 years 8 months ago
2004
Abstract. In recent years, within the planning literature there has been a departure from approaches computing total plans for given goals, in favour of approaches computing partia...
188
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
167
click to vote
AVI
2010
15 years 8 months ago
2010
This paper reports on an empirical study designed as a follow-up of a theoretical model intended to support reasoning about the composition of smart artifacts by end-users. We hav...
178
click to vote
DKE
2006
15 years 7 months ago
2006
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...