Results 271 to 280 of about 53,721 (305)

On transitive closure logic

2005
We present Ehrenfeucht-Fraisse games for transitive closure logic (FO + TC) and for quantifier classes in (FO + TC). With this method we investigate the fine structure of positive transitive closure logic (FO + pos TC), and identify an infinite quantifier hierarchy inside (FO + pos TC), formed by interleaving universal quantifiers and TC-operators.
openaire   +1 more source

Complementation and Transitive Closure

1999
Over infinite structures, there is a strict hierarchy of languages that is obtained by alternating uses of the least-fixed point operator and negation. For finite structures, we show that the hierarchy collapses to its first-level.
openaire   +1 more source

Transitive dependencies in transaction closures

Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156), 2002
Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. termination or execution dependencies which are constraints on the occurrence of significant transaction events.
K. Schwarz, C. Turker, G. Saake
openaire   +1 more source

Anti-Section Transitive Closure

2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC), 2021
Oded Green, Zhihui Du, Sanyamee Patel, Zehui Xie, Hang Liu, David A. Bader   +5 more
openaire   +1 more source

Nested Pebbles and Transitive Closure

2006
First-order logic with k-ary deterministic transitive closure has the same power as two-way k-head deterministic automata that use a finite set of nested pebbles. This result is valid for strings, ranked trees, and in general for families of graphs having a fixed automaton that can be used to traverse the nodes of each of the graphs in the family ...
Joost Engelfriet, Hendrik Jan Hoogeboom
openaire   +1 more source

Modal Logics with Transitive Closure

2014
This last chapter is about the model construction problem in classes of models having relations that are transitive closures of other relations. The main such logics are linear-time temporal logic LTL and propositional dynamic logic PDL. These logics require both blocking and model checking.
Olivier Gasquet, Andreas Herzig, Bilal Said, François Schwarzentruber   +3 more
openaire   +1 more source

An improved transitive closure algorithm

Computing, 1983
Several efficient transitive closure algorithms operate on the strongly connected components of a digraph, some of them using Tarjan's algorithm [17]. Exploiting facts from graph theory and the special properties of Tarjan's algorithm we develop a new, improved algorithm.
openaire   +2 more sources

Caching transitive closures

Proceedings of the 19th annual conference on Computer Science - CSC '91, 1991
Chandon Chitale, John Sieg
openaire   +1 more source

Multiprocessor Transitive Closure Algorithms

Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems, 2005
R. Agrawal, H.V. Jagadish
openaire   +1 more source

Shortest Paths and Transitive Closure

1992
Let G = (V, E) be an undirected graph and let l be a function assigning a nonnegative length to each edge. Extend l to domain V x V by defining l(υ, υ) = 0 and l(u, υ) = ∞ if (u, υ) ∉ E. Define the length2 of a path \( p = {e_{1}}{e_{2}}...{e_{n}}{\text{ to be }}l(p) = \Sigma _{{i = 1}}^{n}l({e_{i}}). \).
openaire   +1 more source