117 search results - page 1 / 24 » On Complexity of Model-Checking for the TQL Logic |
IFIP
2004
Springer
13 years 10 months 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...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
LOGCOM
2002
13 years 4 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
MMNS
2004
13 years 6 months ago
2004
Due to the significant development of network services in the past few years, their validation has become increasingly difficult. The advent of novel approaches to the issue of val...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The pa...