846 search results - page 91 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
107
Voted
FOSSACS
2007
Springer
15 years 7 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
122
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Measurement of the delay is an important and common problem in communication over packet networks. The endto-end and the round trip delay are among the factors directly impacting ...
118
click to vote
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
121
Voted
ERLANG
2003
ACM
15 years 6 months ago
2003
ACM
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...