Results 1 to 10 of about 453,973 (330)

The women made it work: fuzzy transitive closure of the results chain in a dengue prevention trial in Mexico [PDF]

open access: yesBMC 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   +3 more sources

Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting [PDF]

open access: diamondElectronic 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   +5 more sources

Transitive Closure of Interval-valued Fuzzy Relations [PDF]

open access: goldInternational 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   +3 more sources

Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing [PDF]

open access: yesBMC 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   +3 more sources

Cyclic Proofs, Hypersequents, and Transitive Closure Logic [PDF]

open access: greenInternational Joint Conference on Automated Reasoning, 2022
We propose a cut-free cyclic system for Transitive Closure Logic (TCL) based on a form of hypersequents, suitable for automated reasoning via proof search. We show that previously proposed sequent systems are cut-free incomplete for basic validities from
Anupam Das, Marianna Girlando
semanticscholar   +5 more sources

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]

open access: diamondLogical 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   +2 more sources

Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction [PDF]

open access: greenIEEE International Conference on Data Engineering, 2021
Regular path queries (RPQs) find pairs of vertices of paths satisfying given regular expressions on an edge-labeled, directed multigraph. When evaluating an RPQ, the evaluation of a Kleene closure is very expensive.
Inju Na   +4 more
openalex   +3 more sources

Faster Fully Dynamic Transitive Closure in Practice [PDF]

open access: greenThe Sea, 2020
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions.
Kathrin Hanauer   +2 more
openalex   +2 more sources

Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations [PDF]

open access: greenLogic in Computer Science, 2023
We study the decidability and complexity of equational theories of the existential calculus of relations with transitive closure (ECoR*) and its fragments, where ECoR* is the positive calculus of relations with transitive closure extended with ...
Yoshiki Nakamura
openalex   +3 more sources

Transitive-closure spanners [PDF]

open access: greenSIAM Journal on Computing, 2009
Given a directed graph G = (V,E) and an integer k>=1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, E_H) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were implicitly studied in access control, data structures, and property testing, and properties of these spanners have been
Arnab Bhattacharyya   +4 more
openalex   +5 more sources

Home - About - Disclaimer - Privacy