Alexis Bès

Publication Activity (10 Years)

Years Active: 1997-2022
Publications (10 Years): 7

Top Topics

Automatically Generating

Theoretical Framework

Query Answering

Top Venues

Log. Methods Comput. Sci.

Fundam. Informaticae

Publications

Alexis Bès, Christian Choffrut
Decidability of Definability Issues in the Theory of Real Addition. Fundam. Informaticae 188 (1) (2022)
Alexis Bès, Christian Choffrut
Theories of real addition with and without a predicate for integers. Log. Methods Comput. Sci. 17 (2) (2021)
Alexis Bès, Christian Choffrut
$\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $. LATA (2020)
Alexis Bès, Christian Choffrut
Theories of real addition with and without a predicate for integers. CoRR (2020)
Alexis Bès, Christian Choffrut
Complexity and (Un)decidability of Fragments of 〈 ω ω λ ;× 〉. Fundam. Informaticae 164 (1) (2019)
Alexis Bès, Christian Choffrut
Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals. CoRR (2018)
Alexis Bès, Christian Choffrut
; × 〉. CoRR (2018)
Alexis Bès
Expansions of MSO by cardinality relations. Log. Methods Comput. Sci. 9 (4) (2013)
Alexis Bès, Alexander Rabinovich
On countable chains having decidable monadic theory. J. Symb. Log. 77 (2) (2012)
Alexis Bès, Alexander Rabinovich
Decidable Expansions of Labelled Linear Orderings Log. Methods Comput. Sci. 7 (2) (2011)
Alexis Bès, Olivier Carton
Algebraic Characterization of FO for Scattered Linear Orderings. CSL (2011)
Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal
Logic and Rational Languages of Words Indexed by Linear Orderings. Theory Comput. Syst. 46 (4) (2010)
Alexis Bès, Alexander Rabinovich
Decidable Expansions of Labelled Linear Orderings. Fields of Logic and Computation (2010)
Alexis Bès, Patrick Cégielski
Weakly maximal decidable structures. RAIRO Theor. Informatics Appl. 42 (1) (2008)
Alexis Bès
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet. Log. Methods Comput. Sci. 4 (1) (2008)
Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal
Logic and Rational Languages of Words Indexed by Linear Orderings. CSR (2008)
Alexis Bès
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet CoRR (2008)
Alexis Bès, Olivier Carton
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Int. J. Found. Comput. Sci. 17 (3) (2006)
Alexis Bès, Olivier Carton
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Developments in Language Theory (2005)
Jef Wijsen, Alexis Bès
On query optimization in a temporal SPC algebra. Data Knowl. Eng. 44 (2) (2003)
Jef Wijsen, Alexis Bès
Temporal Tableau Queries. TIME (2001)
Alexis Bès
An Extension of The Cobham-Semënov Theorem. J. Symb. Log. 65 (1) (2000)
Alexis Bès, Denis Richard
Undecidable Extensions of Skolem Arithmetic. J. Symb. Log. 63 (2) (1998)
Alexis Bès
On Pascal Triangles Modulo a Prime Power. Ann. Pure Appl. Log. 89 (1) (1997)
Alexis Bès
Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem. J. Symb. Log. 62 (4) (1997)