Sciweavers

275 search results - page 26 / 55
» The Complexity of Generalized Satisfiability for Linear Temp...
Sort
View
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
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...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
TOCL
2011
87views more  TOCL 2011»
13 years 2 months ago
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
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...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
ECAI
2010
Springer
13 years 5 months ago
LTL Goal Specifications Revisited
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...
Andreas Bauer 0002, Patrik Haslum
ATAL
2008
Springer
13 years 9 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
CATS
2007
13 years 9 months ago
A Linear Time Algorithm for Pricing European Sequential Barrier Options
Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major concern in financial mark...
Peng Gao, Ron van der Meyden