Search
Search Results
-
Community detection of weighted complex networks via transitive closure
The K-means algorithm has been successfully applied to many complex network analysis problems. However, this method is sensitive to how the first...
-
Cyclic Hypersequent System for Transitive Closure Logic
We propose a cut-free cyclic system for transitive closure logic (TCL) based on a form of hypersequents , suitable for automated reasoning via proof...
-
Incremental Transitive Closure for Zonal Abstract Domain
The Zonal numerical domain is an efficient, weakly-relational abstract domain in static analysis by abstract interpretation. Compared to the Interval...
-
Bitwise Algorithms to Compute the Transitive Closure of Graphs in Python
The transitive closure (TC) of a graph is a core problem in graph analytics. There exist many High Performance Computing (HPC) and database solutions...
-
The role of transitive closure in evaluating blocking methods for dirty entity resolution
Entity resolution (ER) is a process that identifies duplicate records referring to a real-world entity and links them together in one or more...
-
Cyclic Proofs, Hypersequents, and Transitive Closure Logic
We propose a cut-free cyclic system for Transitive Closure Logic (TCL) based on a form of hypersequents, suitable for automated reasoning via proof...
-
Enhancing trust transfer in supply chain finance: a blockchain-based transitive trust model
Artificial intelligence and blockchain technology have become indispensable in the era of the digital economy, particularly in the field of financial...
-
st-Orientations with Few Transitive Edges
The problem of orienting the edges of an undirected graph such that the resulting digraph is acyclic and has a single source s and a single sink t...
-
Relational Extension of Closure Structures
Closure is a key concept in several branches of mathematics. This work presents a definition of fuzzy closure relation and relational closure system...
-
Handling Transitive Relations in First-Order Automated Reasoning
We present a number of alternative ways of handling transitive binary relations that commonly occur in first-order problems, in particular equivalence...
-
On the Commutative Diagrams Among Galois Connections Involved in Closure Structures
In previous works we proved that fuzzy closure structures such as closure systems, fuzzy closure systems, fuzzy closure operators and fuzzy closure...
-
Transitive-closure-based model checking (TCMC) in Alloy
We present transitive-closure-based model checking (TCMC): a symbolic representation of the semantics of computational tree logic with fairness...
-
Characterizing Multipreference Closure with System W
System W is an approach to reasoning from conditional beliefs that exhibits many properties desirable for nonmonotonic reasoning like extending...
-
Closure and Decision Properties for Higher-Dimensional Automata
In this paper we develop the language theory of higher-dimensional automata (HDAs). Regular languages of HDAs are sets of finite interval partially...
-
Rational Closure Extension in SPO-Representable Inductive Inference Operators
The class of inductive inference operators that extend rational closure, as introduced by Lehmann or via Pearl’s system Z, exhibits desirable...
-
Discussing Uninorms on Bounded Lattices Using Closure and Interior Operators
Uninorms on bounded lattices have recently become a significant area of study. In the present study, we describe two new approaches for creating...
-
Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies
Inconsistency in formal ontologies is usually addressed by computing repairs for the dataset. There are several strategies for selecting the repairs...
-
On integer closure in a system of unit two variable per inequality constraints
In this paper, we study the problem of computing the lattice point closure of a conjunction of Unit Two Variable Per Inequality (UTVPI) constraints....
-
Fuzzy rough digraph based on strength of connectedness with application
Rough digraph is an effective tool for dealing with uncertain data and has been widely used in network analysis. At present, a rough digraph...
-
Fast and Incremental Computation of Weak Control Closure
Control dependence is a fundamental concept used in many program analysis techniques such as program slicing, program debugging, program...