research
∙
05/02/2023
Reverse Engineering of Temporal Queries Mediated by LTL Ontologies
In reverse engineering of database queries, we aim to construct a query ...
share
research
∙
03/29/2023
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder
Temporal logics for the specification of information-flow properties are...
research
∙
05/03/2022
Unique Characterisability and Learnability of Temporal Instance Queries
We aim to determine which temporal instance queries can be uniquely char...
research
∙
02/15/2022
Interpolants and Explicit Definitions in Extensions of the Description Logic EL
We show that the vast majority of extensions of the description logic ℰℒ...
research
∙
05/10/2021
HyperLTL Satisfiability is Σ_1^1-complete, HyperCTL* Satisfiability is Σ_1^2-complete
Temporal logics for the specification of information-flow properties are...
research
∙
03/30/2019
FO = FO3 for linear orders with monotone binary relations
We show that over the class of linear orders with additional binary rela...
research
∙
04/26/2018
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"
Message sequence charts (MSCs) naturally arise as executions of communic...
research
∙
02/23/2018
Gossiping in Message-Passing Systems
We study the gossip problem in a message-passing environment: When a pro...
research
∙
09/28/2017