1032 search results - page 61 / 207 » Extended Computation Tree Logic |
CADE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
ECCV
1998
Springer
15 years 12 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
TACS
1994
Springer
15 years 2 months ago
1994
Springer
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
ECSQARU
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
JSAC
2006
14 years 10 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...