Alexis Bès - Research
LACL, team “Logic, Computation and Programming”
Research interests
- Logic (definability and decidability issues)
- Finite automata and formal languages
- Numeration systems
- Databases
Publications
Journals
- A.Bès, C.Choffrut, Decidability of definability issues in the theory of real addition, Fundamenta Informaticae 188(1), 2022
- A.Bès, C.Choffrut, Theories of real addition with and without a predicate for integers, Logical Methods in Computer Science 17(2), 2021
- A.Bès, C.Choffrut, Complexity and (un)decidability of fragments of (omega^{omega^lambda},*), Fundamenta Informaticae, vol. 164, no. 1, pp. 1-15, 2019
- A.Bès, Expansions of MSO by Cardinality Relations, Logical Methods in Computer Science 9(4), 2013
- A.Bès, A. Rabinovich, On countable chains having decidable monadic theory, J. Symb. Log. 77(2), 593-608, 2012
- A.Bès, A. Rabinovich, Decidable Expansions of Labelled Linear Orderings, Logical Methods in Computer Science 7(2), 2011
- N.Bedon, A.Bès, O.Carton, C.Rispal, Logic and Rational Languages of Words Indexed by Linear Orderings, Theory of Computing Systems, Volume 46, Number 4, 737-760, 2010.
- A.Bès, P.Cégielski, Nonmaximal decidable structures, Journal of Mathematical Sciences, vol.158, 615-622, 2009.
- A.Bès, An application of the Feferman-Vaught theorem to automata and logics for words over an infinite alphabet, Logical Methods in Computer Science 4(1), 2008
- A.Bès, P.Cégielski, Weakly maximal decidable structures, RAIRO-Theor. Inf. Appl. 42 1, 137-145, 2008
- A.Bès, O.Carton, A Kleene theorem for languages of words indexed by linear orderings, International Journal of Foundations of Computer Science
Vol. 17, No. 3, pp. 519-542, 2006
- J.Wijsen, A.Bès, On query optimization in a temporal SPC algebra.
Data & Knowledge Engineering , 44(2):165-192, 2003.
- A.Bès, A survey of arithmetical definability, in: A tribute
to Maurice Boffa, Soc.Math. Belgique, 1-54 (2002).
- A.Bès, Definability and decidability results related to the
elementary theory of ordinal multiplication, Fund.Math.171, 197-211 (2002). Errata
- A.Bès, An extension of the Cobham-Semënov theorem,
J.Symb.Logic 65(1), 201-211 (2000)
- A.Bès, I.Korec, Definability within structures related to
Pascal's triangle modulo an integer, Fund. Math. 156, 111-129
(1998).
- A.Bès, D.Richard, Undecidable extensions of Skolem Arithmetic, J.Symb.Logic 63(2), 379-401 (1998)
- A.Bès, On Pascal triangles modulo a prime power, Ann. Pure Appl. Logic 89, 17-35 (1997).
- A.Bès, Undecidable extensions of Büchi Arithmetic and
Cobham-Semenov Theorem, J.Symb.Logic 62(4), 1280-1296 (1997)
- A.Bès, D.Richard, Extensions indécidables de l'arithmétique
de Skolem, C.R. Acad. Sci. Paris t.323, série I,
967--970 (1996).
Conferences
- A.Bès, C.Choffrut, (R,+,<,1) is decidable in (R,+,<,Z), Proc. LATA 2020, LNCS 12038, 2020
- A.Bès, O.Carton, Algebraic Characterization of FO for Scattered Linear Orderings, in CSL'11, LIPIcs vol.12, 67-81, 2011
- A. Bès, A. Rabinovich, Decidable Expansions of Labelled Linear Orderings,
Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, LNCS 6300, 95-107, 2010
- N.Bedon, A.Bès, O.Carton, C.Rispal, Logic and Rational
Languages of Words Indexed by Linear Orderings, in CSR'08, LNCS 5010,
76-85, 2008.
- A.Bès, O.Carton, A Kleene theorem for languages of words indexed by linear orderings, in DLT'2005, LNCS 3572, 158-167, Springer-Verlag, 2005.
- J.Wijsen, A.Bès, Temporal Tableaux Queries,
In Proc. Eighth Int. Symposium on Temporal Representation and Reasoning
TIME'01, pages 136-143. IEEE Computer Society Press, 2001.
PhD Thesis
- A.Bès, Problèmes de définissabilité
arithmétique: triangles de Pascal, arithmétique de Presburger
et arithmétique de Skolem, Université Paris 7,
1996.
Talks