Related papers: Dichotomy for Axiomatising Inclusion Dependencies …
Local consistency arises in diverse areas, including Bayesian statistics, relational databases, and quantum foundations, and so does the notion of functional dependence. We adopt a general approach to study logical inference in a setting…
Inclusion dependencies form one of the most widely used dependency classes. We extend existing results on the axiomatization and computational complexity of their implication problem to two extended variants. We present an alternative…
We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the…
The reliability of a Boolean Conjunctive Query (CQ) over a tuple-independent probabilistic database is the probability that the CQ is satisfied when the tuples of the database are sampled one by one, independently, with their associated…
In this paper we deal with the problem of axiomatizing the preference relations modelled through Choquet integral with respect to a $k$-additive capacity, i.e. whose M\"obius transform vanishes for subsets of more than $k$ elements. Thus,…
We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…
This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…
We show that the K-theory of C*-algebras can be defined by pairs of matrices satisfying less strict relations than idempotency.
We study various notions of dependency in semiring team semantics. Semiring teams are essentially database relations, where each tuple is annotated with some element from a positive semiring. We consider semiring generalizations of several…
We study the complexity of enumerating the answers of Conjunctive Queries (CQs) in the presence of Functional Dependencies (FDs). Our focus is on the ability to list output tuples with a constant delay in between, following a linear-time…
We establish a connection between dependence structures and subclasses of distortion riskmetrics under which the latter are additive. A new notion of positive dependence, called partial comonotonicity, is developed, which nests the existing…
We introduce two approximate variants of inclusion dependencies and examine the axiomatization and computational complexity of their implication problems. The approximate variants allow for some imperfection in the database and differ in…
The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…
We contribute to the recent line of work on responsibility measures that quantify the contributions of database facts to obtaining a query result. In contrast to existing work which has almost exclusively focused on monotone queries, here…
Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss dependencies between lexicographically ordered sets of tuples. We…
Infamously, the finite and unrestricted implication problems for the classes of i) functional and inclusion dependencies together, and ii) embedded multivalued dependencies alone are each undecidable. Famously, the restriction of i) to…
In this paper, we establish a theorem that proves a condition when an inclusion morphism between simplicial sets becomes a weak homotopy equivalence. Additionally, we present two applications of this result. The first application…
We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express…
The objective of this research paper is to study the relationship between a block of a finite group and a defect group of such block. We define a new notion which is called a strongly $k(D)$-block and give a necessary and sufficient…
In this paper we introduce a homotopy theoretic technique for proving that the $K$-theoretic assembly map is an equivalence. It is an extension of the methods used to prove split injectivity of the assembly and applies to any geometrically…