5216 search results - page 237 / 1044 » Planning as Model Checking |
117
click to vote
IJCAI
2003
15 years 5 months ago
2003
The ability to recognize when an agent abandons a plan is an open problem in the plan recognition literature and is a significant problem if these methods are to be applied in rea...
185
click to vote
TACAS
2000
Springer
15 years 8 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
145
click to vote
KBSE
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
134
click to vote
ENTCS
2007
15 years 4 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
119
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— We present a systematic method for constructing 3-D models of large outdoor sites. The method is designed for a mobile robot platform and incorporates automated acquisition of ...