144 search results - page 21 / 29 » Complexity Results for Modal Dependence Logic |
188
click to vote
SPE
2002
15 years 5 months ago
2002
This study presents a practical solution for data collection and restoration to migrate a process written in high level stack-based languages such as C and Fortran over a network ...
173
click to vote
ICFEM
2009
Springer
15 years 3 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
172
click to vote
DOCENG
2006
ACM
15 years 11 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
212
click to vote
CI
2000
15 years 5 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
169
click to vote
STACS
2010
Springer
16 years 24 days ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...