Related papers: Dichotomy for Axiomatising Inclusion Dependencies …
The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded…
Matching Dependencies (MDs) are a relatively recent proposal for declarative entity resolution. They are rules that specify, given the similarities satisfied by values in a database, what values should be considered duplicates, and have to…
We define and axiomatize approximate exclusion atoms in the team semantic setting. A team is a set of assignments, which can be seen as a mathematical model of a uni-relational database, and we say that an approximate exclusion atom is…
The multipullback quantization of complex projective spaces lacks the naive quantum CW-complex structure because the quantization of an embedding of the $n$-skeleton into the $(n+1)$-skeleton does not exist. To overcome this difficulty, we…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
We introduce an axiomatic approach to entropies and relative entropies that relies only on minimal information-theoretic axioms, namely monotonicity under mixing and data-processing as well as additivity for product distributions. We find…
The main objective of this paper is to propose a definition of non-connective K-theory for a wide class of relative exact categories which, in general, do not satisfy the factorization axiom and confirm that it agrees with the…
Several research thrusts in the area of data management have focused on understanding how changes in the data affect the output of a view or standing query. Example applications are explaining query results, propagating updates through…
The interplay between local consistency and global consistency has been the object of study in several different areas, including probability theory, relational databases, and quantum information. For relational databases, Beeri, Fagin,…
We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…
Performing an additive decomposition of arbitrary functions of random elements is paramount for global sensitivity analysis and, therefore, the interpretation of black-box models. The well-known seminal work of Hoeffding characterized the…
It is proved that the assembly maps in algebraic K- and L-theory with respect to the family of finite subgroups is injective for groups with finite asymptotic dimension that admit a finite model for the classifying space for proper actions.…
Compound matrices have found applications in many fields of science including systems and control theory. In particular, a sufficient condition for $k$-contraction is that a logarithmic norm (also called matrix measure) of the $k$-additive…
The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make…
We construct a notion of derived completion which applies to homomorphisms of commutative S-algebras. We study the relationship of the construction with other constructions of completions, and prove various invariance properties. The…
We investigate the problem of constructing fault-tolerant bases in matroids. Given a matroid M and a redundancy parameter k, a k-fault-tolerant basis is a minimum-size set of elements such that, even after the removal of any k elements, the…
This paper is concerned with a class K of models and an abstract notion of submodel <=. Experience in first order model theory has shown the desirability of finding a `monster model' to serve as a universal domain for K. In the original…
We investigate the computational complexity of minimizing the source side-effect in order to remove a given number of tuples from the output of a conjunctive query. In particular, given a multi-relational database $D$, a conjunctive query…
We study the way in which the abstract structure of a small overlap monoid is reflected in, and may be algorithmically deduced from, a small overlap presentation. We show that every C(2) monoid admits an essentially canonical C(2)…
Rule-based languages lie at the core of several areas of central importance to databases and artificial intelligence such as deductive databases and knowledge representation and reasoning. Disjunctive existential rules (a.k.a. disjunctive…