31 citations · 111 across the 33 of their papers we have counts for
8 papers · 1 filter
Computing Repairs Under Functional and Inclusion Dependencies via Argumentation
Yasir Mahmood, Jonni Virtema, Timon Barlag +1
We discover a connection between finding subset-maximal repairs for sets of functional and inclusion dependencies, and computing extensions within argumentation frameworks (AFs). W…
A logic-based framework for database repairs
Nicolas Fröhlich, Arne Meier, Nina Pardal +1
We introduce a general abstract framework for database repairs, where the repair notions are defined using formal logic. We distinguish between integrity constraints and so-called…
Logics with probabilistic team semantics and the Boolean negation
Miika Hannula, Minna Hirvonen, Juha Kontinen +3
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 ind…
Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions
Teemu Hankala, Miika Hannula, Juha Kontinen +1
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 li…
Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity
Juha Kontinen, Max Sandström, Jonni Virtema
We introduce and develop a set-based semantics for asynchronous TeamLTL. We consider two canonical logics in this setting: the extensions of TeamLTL by the Boolean disjunction and…
Strongly complete axiomatization for a logic with probabilistic interventionist counterfactuals
Fausto Barbero, Jonni Virtema
Causal multiteam semantics is a framework where probabilistic notions and causal inference can be studied in a unified setting. We study a logic (PCO) that features marginal probab…