Showing cs.LOShow all
3 papers · 1 filter
cs.LO2024
Advances in Algorithmic Meta Theorems
Sebastian Siebertz, Alexandre Vigny
Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic can be so…
cs.LO2021
First-Order Logic with Connectivity Operators
Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny
First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem, parameterized by solution size. On the other hand, F…
cs.LO2020
Dynamic Query Evaluation Over Structures with Low Degree
Alexandre Vigny
We consider the evaluation of first-order queries over classes of databases that have bounded degree and low degree. More precisely, given a query and a database, we want to effici…