275 search results - page 4 / 55 » The Complexity of Generalized Satisfiability for Linear Temp... |
IANDC
2002
13 years 7 months ago
2002
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
TIME
2003
IEEE
14 years 26 days ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...