2 citations · 2 across the 8 of their papers we have counts for
9 papers
Order-invariant cluster first-order logic on graph classes of bounded degree
Fatemeh Ghasemi, Julien Grange
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant fo…
Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté +1
In this work we take a step towards characterising strongly flip-flat classes of graphs. Strong flip-flatness appears to be the analogue of uniform almost-wideness in the setting o…
Specification and Automatic Verification of Computational Reductions
Julien Grange, Fabian Vehlken, Nils Vortmeier +1
We are interested in the following validation problem for computational reductions: for algorithmic problems and , is a given candidate reduction indeed a reduction fr…
Synthesis for prefix first-order logic on data words
Julien Grange, Mathieu Lehaut
We study the reactive synthesis problem for distributed systems with an unbounded number of participants interacting with an uncontrollable environment. Executions of those systems…
First order synthesis for data words revisited
Julien Grange, Mathieu Lehaut
We carry on the study of the synthesis problem on data words for fragments of first order logic, and delineate precisely the border between decidability and undecidability.
About the Expressive Power and Complexity of Order-Invariance with Two Variables
Bartosz Bednarczyk, Julien Grange
Order-invariant first-order logic is an extension of first-order logic FO where formulae can make use of a linear order on the structures, under the proviso that they are order-inv…
Order-Invariance in the Two-Variable Fragment of First-Order Logic
Julien Grange
We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only all…
On the nonexistence of FO-continuous path and tree-decompositions
Julien Grange
Bojanczyk and Pilipczuk showed in their celebrated article "Definability equals recognizability for graphs of bounded treewidth" (LICS 2016) that monadic second-order logic can def…
Successor-Invariant First-Order Logic on Classes of Bounded Degree
Julien Grange
We study the expressive power of successor-invariant first-order logic, which is an extension of first-order logic where the usage of an additional successor relation on the struct…