Results 1 to 10 of about 685,984 (350)
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
Algebraic structures for transitive closure [PDF]
Theoretical Computer Science, 1977 Closed semi-rings and the closure of matrices oven closed semirings are defined and studied. Closed semirings are structures weaker than the structunes studied by Conway [3] and Aho, Hopcnoft and Ullman [1].
Daniel Lehmann
core +5 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 +3 more sources
Transitive-Closure Spanners [PDF]
SIAM 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 +4 more sources
On Finite Entailment of Non-Local Queries in Description Logics [PDF]
arXiv, 2020 We study the problem of finite entailment of ontology-mediated queries. Going beyond local queries, we allow transitive closure over roles. We focus on ontologies formulated in the description logics ALCOI and ALCOQ, extended with transitive closure. For both logics, we show 2EXPTIME upper bounds for finite entailment of unions of conjunctive queries ...
Gogacz, Tomasz +4 more
arxiv +4 more sources
Tree Canonization and Transitive Closure
Information and Computation, 2000 AbstractWe prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree isomorphism and canonization are in L (1992, S. Lindell, in “24th Symp. on Theory of Comput.” pp. 400–404).
Kousha Etessami, Neil Immerman
openalex +4 more sources
Transitive Closures of Ternary Fuzzy Relations [PDF]
International Journal of Computational Intelligence Systems, 2021 Recently, we have introduced six types of composition of ternary fuzzy relations. These compositions are close in spirit to the composition of binary fuzzy relations.
Lemnaouar Zedam, Bernard De Baets
doaj +4 more sources
An Alternative Construction to the Transitive Closure of a Directed Graph [PDF]
arXiv, 2011 One must add arrows which are forced by transitivity to form the transitive closure of a directed graph. We introduce a construction of a transitive directed graph which is formed by adding vertices instead of arrows and which preserves the transitive relationships formed by distinct vertices in the original directed graph.
Kenneth L. Price
arxiv +3 more sources
Fully dynamic biconnectivity and transitive closure [PDF]
Proceedings of IEEE 36th Annual Foundations of Computer Science, 2002 This paper presents an algorithm for the fully dynamic biconnectivity problem whose running time is exponentially faster than all previously known solutions. It is the first dynamic algorithm that answers biconnectivity queries in time O(log/sup 2/n) in a n-node graph and can be updated after an edge insertion or deletion in polylogarithmic time.
Monika Henzinger, Valerie King
openalex +6 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