Results 11 to 20 of about 53,801 (280)
Service oriented transitive closure solution [PDF]
, 2008 The goal of this project is a service based solution that utilizes parallel and distributed processing algorithms to solve the transitive closure problem for a large dataset.
Baran, Jonathan
core +3 more sources
Reaching Classicality through Transitive Closure
Logic and Logical PhilosophyRecently, Da Ré, Szmuc, Chemla and Égré (2024) showed that all logics based on Boolean Normal monotonic three-valued schemes coincide with classical logic when defined using a strict-tolerant standard (st). Conversely, they proved that under a tolerant-strict standard (ts), the resulting logics are all empty.
Quentin Blomet, Bruno Da Ré
openaire +4 more sources
L-Recursion and a new Logic for Logarithmic Space [PDF]
, 2011 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.
, , Grohe, Martin, Laubner, Bastian
core +1 more source
Algebraic optimization of recursive queries [PDF]
, 1992 Over the past few years, much attention has been paid to deductive databases. They offer a logic-based interface, and allow formulation of complex recursive queries.
Apers, Peter M.G. +2 more
core +5 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
The tiered Aubry set for autonomous Lagrangian functions [PDF]
, 2008 If L is a Tonelli Lagrangian defined on the tangent bundle of a compact and connected manifold whose dimension is at least 2, we associate to L the tiered Aubry set and the tiered Mane set (defined in the article).
Arnaud, Marie-Claude
core +3 more sources
Complex transitive closure queries on a fragmented graph [PDF]
, 1990 In this paper we study the reformulation of transitive closure queries on a fragmented graph. We split a query into several subqueries, each requiring only a fragment of the graph.
Apers, Peter M.G. +2 more
core +2 more sources
K-causality coincides with stable causality
, 2008 It is proven that K-causality coincides with stable causality, and that in a K-causal spacetime the relation K^+ coincides with the Seifert's relation. As a consequence the causal relation "the spacetime is strongly causal and the closure of the causal ...
Minguzzi, E.
core +2 more sources
Subword complexes via triangulations of root polytopes [PDF]
, 2017 Subword complexes are simplicial complexes introduced by Knutson and Miller to illustrate the combinatorics of Schubert polynomials and determinantal ideals. They proved that any subword complex is homeomorphic to a ball or a sphere and asked about their
Escobar, Laura, Mészáros, Karola
core +3 more sources
Advanced Intelligent Discovery, EarlyView.This study integrates random matrix theory (RMT) and principal component analysis (PCA) to improve the identification of correlated regions in HIV protein sequences for vaccine design. PCA validation enhances the reliability of RMT‐derived correlations, particularly in small‐sample, high‐dimensional datasets, enabling more accurate detection of ...
Mariyam Siddiqah +3 more
wiley +1 more source