40 search results - page 2 / 8 » Tractable Interval Temporal Propositional and Description Lo... |
71
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
2005
Springer
113
Voted
TIME
2007
IEEE
15 years 6 months ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
110
Voted
CORR
2008
Springer
14 years 12 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...
104
Voted
TOCL
2011
14 years 7 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...
114
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...