121 search results - page 14 / 25 » The complexity of temporal logic over the reals |
117
Voted
AAAI
2006
15 years 1 months ago
2006
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
100
Voted
CORR
2008
Springer
14 years 11 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...
95
Voted
TOCL
2011
14 years 6 months ago
2011
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 s...
ICSE
2008
IEEE-ACM
16 years 14 days ago
2008
IEEE-ACM
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
111
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
A Spatio-Temporal Association Rule (STAR) describes how objects move between regions over time. Since they describe only a single movement between two regions, it is very difficu...