5216 search results - page 211 / 1044 » Planning as Model Checking |
134
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
105
Voted
ENTCS
2008
15 years 2 months ago
2008
103
Voted
SAC
2008
ACM
15 years 2 months ago
2008
ACM
Business
104
Voted
FOSSACS
2010
Springer
15 years 1 months ago
2010
Springer
102
Voted
ISSE
2010
15 years 1 months ago
2010