Related papers: Dichotomy for Axiomatising Inclusion Dependencies …
According to the distributional inclusion hypothesis, entailment between words can be measured via the feature inclusions of their distributional vectors. In recent work, we showed how this hypothesis can be extended from words to phrases…
The notion of weak truth-table reducibility plays an important role in recursion theory. In this paper, we introduce an elaboration of this notion, where a computable bound on the use function is explicitly specified. This elaboration…
A new seemingly weak axiomatic formulation of information algebras is given. It is shown how such information algebras can be embedded into set (information) algebras. In set algebras there is a natural relation of conditional independence…
Representation learning is a fundamental building block for analyzing entities in a database. While the existing embedding learning methods are effective in various data mining problems, their applicability is often limited because these…
A relation modification problem gets a logical structure and a natural number k as input and asks whether k modifications of the structure suffice to make it satisfy a predefined property. We provide a complete classification of the…
Existential positive formulas form a fragment of first-order logic that includes and is semantically equivalent to unions of conjunctive queries, one of the most important and well-studied classes of queries in database theory. We consider…
Motivated by the free products of groups, the direct sums of modules, and Shelah's $(\lambda,2)$-goodness, we study strong amalgamation properties in Abstract Elementary Classes. Such a notion of amalgamation consists of a selection of…
Incorporating multiple knowledge sources is proven to be beneficial for answering complex factoid questions. To utilize multiple knowledge bases (KB), previous works merge all KBs into a single graph via entity alignment and reduce the…
When $\mathcal D$ is strongly self-absorbing we say an inclusion $B \subseteq A$ is $\mathcal D$-stable if it is isomorphic to the inclusion $B \otimes \mathcal D \subseteq A \otimes \mathcal D$. We give ultrapower characterizations and…
We show a new reduction method on a simplicial complex. This reduction works well with relations and Dowker complexes. The idea is to add a dummy vertex $ z $ to the simplicial complex $K$. We add the simplicial cone $ z * L $ to $K$ where…
Inspired by the visualization of dental plaque at the dentist's office, this article proposes a novel visualization of redundancies in relational data. Our approach is based on a well-principled information-theoretic framework that has so…
Given a positive integer $k$, we investigate the $k$-redcibility of self-maps in the monoid $\AA^k(X\vee Y)$, consisting of self-maps that induce isomorphisms on homology groups up to degree $k$. In general, verifying $k$-reducibility is a…
We study the complexity of various fundamental counting problems that arise in the context of incomplete databases, i.e., relational databases that can contain unknown values in the form of labeled nulls. Specifically, we assume that the…
We introduce a novel variant of logical relations that maps types not merely to partial equivalence relations on values, as is commonly done, but rather to a proof-relevant generalisation thereof, namely setoids. The objects of a setoid…
The Random K-Satisfiability Problem, consisting in verifying the existence of an assignment of N Boolean variables that satisfy a set of M=alpha N random logical clauses containing K variables each, is studied using the replica symmetric…
A vanishing theorem for uniformly RC $k$-positive Hermitian holomorphic vector bundles is established. It turns out that the holomorphic tangent bundle of a compact complex manifold equipped with a positive $k$-Ricci curvature K\"{a}hler…
We propose a partial information decomposition based on the newly introduced framework of causal tensors, i.e., multilinear stochastic maps that transform source data into destination data. This framework enables us to express an indirect…
Does the sum of correlations in subsystems constitute the correlation in the total system? Such a concept can be expressed by an additivity relationship of correlations. From a strong subadditivity condition of von Neumann entropy, four…
We consider the properties weak cancellation, K_1-surjectivity, good index theory, and K_1-injectivity for the class of extremally rich C*-algebras, and for the smaller class of isometrically rich C*-algebras. We establish all four…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…