955 search results - page 7 / 191 » Tractable Temporal Reasoning |
CORR
2008
Springer
13 years 7 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...
TOCL
2011
13 years 2 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...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
ICSE
2008
IEEE-ACM
14 years 8 months 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...
DLOG
2009
13 years 8 months ago
2009
Abstract. We present a family of expressive extensions of Datalog, called Datalog