Results 21 to 30 of about 453,973 (330)
L-Recursion and a new Logic for Logarithmic Space [PDF]
Logical Methods in Computer Science, 2013 We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space.
Martin Grohe +3 more
doaj +1 more source
Transitive closure and recursive Datalog implemented on clusters
International Conference on Extending Database Technology, 2012 Foto Afrati, Jeffrey D. Ullman
openalex +2 more sources
Characterization of Transitivity in L-Tolerance Spaces by Convergence and Closure
Axioms, 2021 We show that the category of quantale-valued tolerance spaces is isomorphic to a category of quantale-valued convergence spaces. We define suitable quantale-valued closure functions and use them to characterize transitivity axioms.
Gunther Jäger, T. M. G. Ahsanullah
doaj +1 more source
Causal Pathway Extraction from Web-Board Documents
Applied Sciences, 2021 This research aim is to extract causal pathways, particularly disease causal pathways, through cause-effect relation (CErel) extraction from web-board documents.
Chaveevan Pechsiri, Rapepun Piriyakul
doaj +1 more source
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 +1 more source
On the Power of Deterministic Transitive Closures
Information and Computation, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gradel, E., Mccolm, G.L.
openaire +2 more sources
Dual digraphs of finite semidistributive lattices
Cubo, 2022 Dual digraphs of finite join-semidistributive lattices, meet-semidistributive lattices and semidistributive lattices are characterised. The vertices of the dual digraphs are maximal disjoint filter-ideal pairs of the lattice.
Andrew Craig +2 more
doaj +1 more source
Tree Canonization and Transitive Closure
Information and Computation, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Etessami, E, Immerman, N
openaire +2 more sources
Annals of Mathematics and Artificial Intelligence, 2013 George Fletcher +6 more
openalex +3 more sources
Transitive closure of interval-valued relations [PDF]
2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008 Peer ...
González del Campo, Ramón +2 more
openaire +2 more sources