2 citations · 2 across the 11 of their papers we have counts for
11 papers
Aspects of Coherence in Dependence Logic
Timon Barlag, Nicolas Fröhlich, Miika Hannula +4
Dependence logic extends first-order logic with dependence atoms asserting that the value of a variable is determined by the values of certain other variables. The semantics of dep…
Inconsistent Databases and Argumentation Frameworks with Collective Attacks
Yasir Mahmood, Jonni Virtema, Timon Barlag +1
The connection between subset-maximal repairs for inconsistent databases involving various integrity constraints and acceptable sets of arguments within argumentation frameworks ha…
Recurrent Graph Neural Networks and Arithmetic Circuits
Timon Barlag, Vivian Holzapfel, Laura Strieker +2
We characterise the computational power of recurrent graph neural networks (GNNs) in terms of arithmetic circuits over the real numbers. Our networks are not restricted to aggregat…
Logical Approaches to Non-deterministic Polynomial Time over Semirings
Timon Barlag, Nicolas Fröhlich, Teemu Hankala +6
We provide a logical characterization of non-deterministic polynomial time defined by BSS machines over semirings via existential second-order logic interpreted in the semiring sem…
Locally Consistent K-relations: Entailment and Axioms of Functional Dependence
Timon Barlag, Miika Hannula, Juha Kontinen +2
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…
Logic and Computation through the Lens of Semirings
Timon Barlag, Nicolas Fröhlich, Teemu Hankala +6
We study the expressivity and computational aspects of first-order logic and its extensions in the semiring semantics developed by Grädel and Tannen. We characterize the complexity…
Graph Neural Networks and Arithmetic Circuits
Timon Barlag, Vivian Holzapfel, Laura Strieker +2
We characterize the computational power of neural networks that follow the graph neural network (GNN) architecture, not restricted to aggregate-combine GNNs or other particular typ…
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…
Unified Foundations of Team Semantics via Semirings
Timon Barlag, Miika Hannula, Juha Kontinen +2
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 st…
Logical Characterization of Algebraic Circuit Classes over Integral Domains
Timon Barlag, Florian Chudigiewitsch, Sabrina Alexandra Gaube
We present an adapted construction of algebraic circuits over the reals introduced by Cucker and Meer to arbitrary infinite integral domains and generalize the $\mathrm{AC}_{\mathb…
A Logical Characterization of Constant-Depth Circuits over the Reals
Timon Barlag, Heribert Vollmer
In this paper we give an Immerman's Theorem for real-valued computation. We define circuits operating over real numbers and show that families of such circuits of polynomial size a…