275 search results - page 1 / 55 » The Complexity of Generalized Satisfiability for Linear Temp... |
FOSSACS
2007
Springer
13 years 8 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
ACTA
2004
13 years 4 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
SIGSOFT
2007
ACM
14 years 5 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
LOGCOM
2007
13 years 4 months ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...