46 search results - page 5 / 10 » The Concurrency Complexity for the Horn Fragment of Linear L... |
IFIP
2004
Springer
14 years 25 days ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
IJCAI
2007
13 years 9 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
CLIMA
2004
13 years 9 months ago
2004
Abstract. Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. It has been demonstrated [19] how symbolic negotiation and distr...
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...