International audienceWe 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 structure is allowed, as long as the validity of formulas is independent on the choice of a particular successor. We show that when the degree is bounded, successor-invariant first-order logic is no more expressive than first-order logic
International audienceThis work deals with the expressive power of logics on finite graphs with acce...
This thesis deals with various aspects of the finite model theory of logics with invariantly used re...
We introduce a new property for classes of structures (or relational database instances), that we ca...
International audienceWe study the expressive power of successor-invariant first-order logic, which ...
We study the expressive power of successor-invariant first-order logic, whichis an extension of firs...
A successor-invariant first-order formula is a formula that has access to an auxiliary successor rel...
A successor-invariant first-order formula is a formula that has access to an auxiliary successor rel...
A successor-invariant first-order formula is a formula that has access to an auxiliary successor rel...
This thesis focuses on the expressive power of two invariant logics: successor-invariant first-order...
This thesis focuses on the expressive power of two invariant logics: successor-invariant first-order...
We show that the expressive power of order-invariant first-order logic collapses to first-order logi...
International audienceWe show that the expressive power of order-invariant first-order logic collaps...
We study the expressive power and succinctness of order-invariant sentences of first-order (FO) and ...
AbstractWe study the expressive power of counting logics in the presence of auxiliary relations such...
Our main result is that every datalog query expressible in first-order logic is bounded; in terms of...
International audienceThis work deals with the expressive power of logics on finite graphs with acce...
This thesis deals with various aspects of the finite model theory of logics with invariantly used re...
We introduce a new property for classes of structures (or relational database instances), that we ca...
International audienceWe study the expressive power of successor-invariant first-order logic, which ...
We study the expressive power of successor-invariant first-order logic, whichis an extension of firs...
A successor-invariant first-order formula is a formula that has access to an auxiliary successor rel...
A successor-invariant first-order formula is a formula that has access to an auxiliary successor rel...
A successor-invariant first-order formula is a formula that has access to an auxiliary successor rel...
This thesis focuses on the expressive power of two invariant logics: successor-invariant first-order...
This thesis focuses on the expressive power of two invariant logics: successor-invariant first-order...
We show that the expressive power of order-invariant first-order logic collapses to first-order logi...
International audienceWe show that the expressive power of order-invariant first-order logic collaps...
We study the expressive power and succinctness of order-invariant sentences of first-order (FO) and ...
AbstractWe study the expressive power of counting logics in the presence of auxiliary relations such...
Our main result is that every datalog query expressible in first-order logic is bounded; in terms of...
International audienceThis work deals with the expressive power of logics on finite graphs with acce...
This thesis deals with various aspects of the finite model theory of logics with invariantly used re...
We introduce a new property for classes of structures (or relational database instances), that we ca...