collaborators

10 papers

cs.LO2026

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…

cs.DB2026

Semijoins of Annotated Relations

Phokion G. Kolaitis

The semijoin operation is a fundamental operation of relational algebra that has been extensively used in query processing. Furthermore, semijoins have been used to formulate desir…

cs.LO2025

Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts

Balder ten Cate, Phokion G. Kolaitis, Arnar Á. Kristjánsson

A query algorithm based on homomorphism counts is a procedure to decide membership for a class of finite relational structures using only homomorphism count queries. A left query a…

cs.DB2025

Gamma Acyclicity, Annotated Relations, and Consistency Witness Functions

Albert Atserias, Phokion G. Kolaitis

During the early days of relational database theory it was realized that "acyclic" database schemas possess a number of desirable semantic properties. In fact, three different noti…

cs.LO2025

Disjunctions of Two Dependence Atoms

Nicolas Fröhlich, Phokion G. Kolaitis, Arne Meier

Dependence logic is a formalism that augments the syntax of first-order logic with dependence atoms asserting that the value of a variable is determined by the values of some other…

cs.LO2025

Who Wins the Multi-Structural Game?

Ronald Fagin, Neil Immerman, Phokion Kolaitis +2

Combinatorial games played between two players, called Spoiler and Duplicator, have often been used to capture syntactic properties of formal logical languages. For instance, the w…