42 search results - page 5 / 9 » The Complexity of Propositional Linear Temporal Logics in Si... |
FSS
2008
13 years 7 months ago
2008
In this paper we propose computationally simple, pointwise formulas for extended t-norms and t-conorms on fuzzy truth values. The complex convolutions of the extended operations a...
LPAR
2001
Springer
14 years 2 days ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
AI
2000
Springer
13 years 7 months ago
2000
Springer
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...