Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
Logical Methods in Computer Science, 2007 String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Joost Engelfriet, Hendrik Jan Hoogeboom
doaj +8 more sources
buTCS: An Optimized Algorithm for Estimating the Size of Transitive Closure [PDF]
IEEE Access, 2021 Given a directed graph and a node $v$ , the transitive closure (TC) of $v$ is the set of nodes that $v$ can reach in the graph. TC size is very important in many applications but the cost of TC size computation is high in both time and space, which ...
Xiaozhe Li +3 more
doaj +2 more sources
The women made it work: fuzzy transitive closure of the results chain in a dengue prevention trial in Mexico [PDF]
BMC Public Health, 2017 Background A modified theory of planned behaviour (acronym CASCADA) proposes that Conscious knowledge precedes a change in Attitude, which in turn precedes positive deviations from negative Subjective norms, intention to Change, perception of Agency to ...
Neil Andersson +4 more
doaj +2 more sources
Model Checking Synchronized Products of Infinite Transition Systems [PDF]
Logical Methods in Computer Science, 2007 Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of reachability ...
Stefan Wöhrle, Wolfgang Thomas
doaj +3 more sources
Transitive Closure of Interval-valued Fuzzy Relations [PDF]
International Journal of Computational Intelligence Systems, 2013 In this paper are introduced some concepts of interval-valued fuzzy relations and some of their properties: reflexivity, symmetry, T-transitivity, composition and local reflexivity.
Ramón González-del-Campo +2 more
doaj +2 more sources
Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We present a new approach to the logical design of relational databases, based on strategic port graph rewriting. We show how to model relational schemata as attributed port graphs and provide port graph rewriting rules to perform computations on ...
János Varga
doaj +3 more sources
AxiomsA randomly generated fuzzy matrix refers to a fuzzy matrix in which the values of elements belong to the sample space of a [0,1]-random variable that follows a certain probability distribution.
Nan Li, Xianfeng Yu, Wuniu Liu
doaj +2 more sources
Speeding Up Floyd–Warshall’s Algorithm to Compute All-Pairs Shortest Paths and the Transitive Closure of a Graph [PDF]
AlgorithmsFloyd–Warshall’s algorithm is a widely-known procedure for computing all-pairs shortest paths in a graph of n vertices in Θ(n3) time complexity. A simplified version of the same algorithm computes the transitive closure of the graph with the same time ...
Giuseppe Lancia, Marcello Dalpasso
doaj +2 more sources
Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing [PDF]
BMC Bioinformatics, 2017 Background RNA secondary structure prediction is a compute intensive task that lies at the core of several search algorithms in bioinformatics. Fortunately, the RNA folding approaches, such as the Nussinov base pair maximization, involve mathematical ...
Marek Palkowski, Wlodzimierz Bielecki
doaj +2 more sources
Service oriented transitive closure solution [PDF]
, 2008 The goal of this project is a service based solution that utilizes parallel and distributed processing algorithms to solve the transitive closure problem for a large dataset.
Jonathan Baran
openalex +3 more sources