Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Hannula, Miika"'
Autor:
Hannula, Miika
Conditional independence plays a foundational role in database theory, probability theory, information theory, and graphical models. In databases, conditional independence appears in database normalization and is known as the (embedded) multivalued d
Externí odkaz:
http://arxiv.org/abs/2310.01910
Autor:
Hannula, Miika
Information inequalities appear in many database applications such as query output size bounds, query containment, and implication between data dependencies. Recently Khamis et al. proposed to study the algorithmic aspects of information inequalities
Externí odkaz:
http://arxiv.org/abs/2309.11818
We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently introduced l
Externí odkaz:
http://arxiv.org/abs/2306.00420
We study the complexity of the problem of training neural networks defined via various activation functions. The training problem is known to be existsR-complete with respect to linear activation functions and the ReLU activation function. We conside
Externí odkaz:
http://arxiv.org/abs/2305.11833
Semiring semantics for first-order logic provides a way to trace how facts represented by a model are used to deduce satisfaction of a formula. Team semantics is a framework for studying logics of dependence and independence in diverse contexts such
Externí odkaz:
http://arxiv.org/abs/2303.07926
Autor:
Hannula, Miika, Wijsen, Jef
Since 2005, significant progress has been made in the problem of Consistent Query Answering (CQA) with respect to primary keys. In this problem, the input is a database instance that may violate one or more primary key constraints. A repair is define
Externí odkaz:
http://arxiv.org/abs/2203.13475
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under the Boole
Externí odkaz:
http://arxiv.org/abs/2104.04313
For years, independence has been considered as an important concept in many disciplines. Nevertheless, we present the first research that investigates the discovery problem of independence in data. In its arguably simplest form, independence is a sta
Externí odkaz:
http://arxiv.org/abs/2101.02502
Codd's rule of entity integrity stipulates that every table has a primary key. Hence, the attributes of the primary key carry unique and complete value combinations. In practice, data cannot always meet such requirements. Previous work proposed the s
Externí odkaz:
http://arxiv.org/abs/2101.02472
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 functional and
Externí odkaz:
http://arxiv.org/abs/2101.02466