Results 11 to 20 of about 559,747 (351)
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
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 +7 more sources
Model Checking Synchronized Products of Infinite Transition Systems [PDF]
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
Computing transitive closures of hedge transformations [PDF]
We consider the framework of regular hedge model checking where configurations are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamic of a system is modelled by a term rewriting system. We consider the problem of computing the transitive closure R*(L) of a hedge automaton L and a
Tayssir Touili
openaire +3 more sources
A 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
Infinitary and Cyclic Proof Systems for Transitive Closure Logic [PDF]
Liron Cohen, Reuben N. S. Rowe
semanticscholar +4 more sources
3-D substructure search by transitive closure in AlphaFold database. [PDF]
Liu H, Laiho A, Törönen P, Holm L.
europepmc +3 more sources
George Fletcher +6 more
openalex +3 more sources
TRACT: Denoising Diffusion Models with Transitive Closure Time-Distillation [PDF]
Denoising Diffusion models have demonstrated their proficiency for generative sampling. However, generating good samples often requires many iterations.
David Berthelot +8 more
semanticscholar +1 more source
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations [PDF]
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
semanticscholar +1 more source
Parallel Transitive Closure Algorithm for Heterogeneous Architecture [PDF]
The traditional method for obtaining the transitive closure of the graphs faces the large amount of calculation and long calculation time. In order to improve the computing speed of the transitive closure algorithm for dealing with large amounts of data,
XIAO Han, GUO Baoyun, LI Cailin, ZHOU Qinglei
doaj +1 more source

