810 search results - page 11 / 162 » Solving Time-Dependent Planning Problems |
KR
2010
Springer
14 years 19 days ago
2010
Springer
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
AI
2008
Springer
13 years 8 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
AUSAI
1997
Springer
14 years 22 hour ago
1997
Springer
Engineering problem solving requires both domain knowledge and an understanding of how to apply that knowledge. While much of the recent work in qualitative physics has focused on...
ECAI
2006
Springer
13 years 9 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
ICTAI
2008
IEEE
14 years 2 months ago
2008
IEEE
In real world we have to deal with changing situations which may partially or entirely invalidate an executable plan. Current strategies for plan repair are basically aimed at sol...