2026-07-24T03:28:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15742 2024-03-06T10:56:05Z ddc:004 open_access

Differential Games, Locality, and Model Checking for FO Logic of Graphs Gajarský, Jakub Gorsky, Maximilian Kreutzer, Stephan FO model checking locality Gaifman’s theorem EF games We introduce differential games for FO logic of graphs, a variant of Ehrenfeucht-Fraïssé games in which the game is played on only one graph and the moves of both players are restricted. We prove that these games are strong enough to capture essential information about graphs from graph classes which are interpretable in nowhere dense graph classes. This, together with the newly introduced notion of differential locality and the fact that the restriction of possible moves by the players makes it easy to decide the winner of the game in some cases, leads to a new approach to the FO model checking problem which can be used on various graph classes interpretable in classes of sparse graphs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jakub Gajarský and Maximilian Gorsky and Stephan Kreutzer 2022 Is Part Of LIPIcs, Volume 216, 30th EACSL Annual Conference on Computer Science Logic (CSL 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2022.22 urn:nbn:de:0030-drops-157426 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.22 eng https://creativecommons.org/licenses/by/4.0/legalcode