31 citations · 111 across the 33 of their papers we have counts for
42 papers
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…
Halting Recurrent GNNs and the Graded -Calculus
Jeroen Bollen, Jan Van den Bussche, Stijn Vansummeren +1
Graph Neural Networks (GNNs) are a class of machine-learning models that operate on graph-structured data. Their expressive power is intimately related to logics that are invariant…
Rewriting Consistent Answers on Annotated Data
Phokion G. Kolaitis, Nina Pardal, Jonni Virtema +1
We embark on a study of the consistent answers of queries over databases annotated with values from a naturally ordered positive semiring. In this setting, the consistent answers o…
Synchronous Team Semantics for Temporal Logics
Andreas Krebs, Arne Meier, Jonni Virtema +1
We present team semantics for two of the most important linear and branching time specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). With team s…
A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL
Juha Kontinen, Max Sandström, Jonni Virtema
Linear temporal logic (LTL) is used in system verification to write formal specifications for reactive systems. However, some relevant properties, e.g. non-inference in information…
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…