Results 11 to 20 of about 685,984 (350)
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 +5 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 +3 more sources
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations [PDF]
arXiv, 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 complements of term variables and constants.
Yoshiki Nakamura
arxiv +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
Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction [PDF]
arXiv, 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 (i.e., Kleene plus or Kleene star) is very expensive. Furthermore, when multiple RPQs include a Kleene closure as a common sub-query, repeated evaluations of
Inju Na +4 more
arxiv +3 more sources
Transitive closure and betweenness relations
Fuzzy Sets and Systems, 2001 Indistinguishability operators fuzzify the concept of equivalence relation and have been proved a useful tool in theoretical studies as well as in di0erent applications such as fuzzy control or approximate reasoning. One interesting problem is their construction. There are di0erent ways depending on how the data are given and on their future use.
D. Boixader, J. Jacas, J. Recasens
openalex +4 more sources
Transitive Closure of Interval-valued Relations [PDF]
2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2009 This paper introduces some concepts of intervalvalued fuzzy relations and some of their properties: reflexivity, symmetry, T-transitivity, composition and locally reflexivity.
Garmendia Salvador, Luis +2 more
core +4 more sources
Data fragmentation for parallel transitive closure strategies [PDF]
, 2002 Addresses the problem of fragmenting a relation to make the parallel computation of the transitive closure efficient, based on the disconnection set approach. To better understand this design problem, the authors focus on transportation networks.
M.A.W. Houtsma +2 more
openalex +4 more sources
on the positive calculus of relations with transitive closure
STACS, 2018 Binary relations are such a basic object that they appear in many places in mathematics and computer science. For instance, when dealing with graphs, program semantics, or termination guarantees, binary relations are always used at some point.
D. Pous
openaire +6 more sources
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure [PDF]
arXiv, 2001 In this paper we introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure.
Camil Demetrescu, Giuseppe F. Italiano
arxiv +3 more sources