AbstractWe give a new construction of formulas in Hanf normal form that are equivalent to first-order formulas over structures of bounded degree. This is the first algorithm whose running time is shown to be elementary. The triply exponential upper bound is complemented by a matching lower bound
International audienceA normal form system (NFS) for representing Boolean functions is thought of as...
This paper considers the structure consisting of the set of all words over a given alphabet together...
AbstractWe introduce a necessary and sufficient condition for the ω-extensionality rule of higher-or...
AbstractWe give a new construction of formulas in Hanf normal form that are equivalent to first-orde...
International audienceWe give a new construction of formulas in Hanf normal form that are equivalent...
Abstract—This paper’s main result presents a 3-fold exponen-tial algorithm that transforms a first-o...
We consider the extension of first-order logic FO by unary counting quantifiers and generalise the n...
We consider the extension of first-order logic FO by unary counting quantifiers and generalise the n...
Normalformen drücken semantische Eigenschaften einer Logik durch syntaktische Restriktionen aus. Sie...
AbstractWe start with a simple proof of Leivant's normal form theorem for ∑11 formulas over finite s...
International audienceWe study the locality of an extension of first-order logic that captures graph...
AbstractGaifman's normal form theorem showed that every first-order sentence of quantifier rank n is...
International audienceWe design algorithms of "optimal" data complexity for several natural problems...
The concepts of admissible orderings and normal form algorithm are basic in Buchberger's Gröbne...
We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the...
International audienceA normal form system (NFS) for representing Boolean functions is thought of as...
This paper considers the structure consisting of the set of all words over a given alphabet together...
AbstractWe introduce a necessary and sufficient condition for the ω-extensionality rule of higher-or...
AbstractWe give a new construction of formulas in Hanf normal form that are equivalent to first-orde...
International audienceWe give a new construction of formulas in Hanf normal form that are equivalent...
Abstract—This paper’s main result presents a 3-fold exponen-tial algorithm that transforms a first-o...
We consider the extension of first-order logic FO by unary counting quantifiers and generalise the n...
We consider the extension of first-order logic FO by unary counting quantifiers and generalise the n...
Normalformen drücken semantische Eigenschaften einer Logik durch syntaktische Restriktionen aus. Sie...
AbstractWe start with a simple proof of Leivant's normal form theorem for ∑11 formulas over finite s...
International audienceWe study the locality of an extension of first-order logic that captures graph...
AbstractGaifman's normal form theorem showed that every first-order sentence of quantifier rank n is...
International audienceWe design algorithms of "optimal" data complexity for several natural problems...
The concepts of admissible orderings and normal form algorithm are basic in Buchberger's Gröbne...
We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the...
International audienceA normal form system (NFS) for representing Boolean functions is thought of as...
This paper considers the structure consisting of the set of all words over a given alphabet together...
AbstractWe introduce a necessary and sufficient condition for the ω-extensionality rule of higher-or...
DOI
Add to ORKG