Arrow Research search

Author name cluster

Thomas Place

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

7 papers
2 author rows

Possible papers

7

CSL Conference 2024 Conference Paper

A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic

  • Thomas Place
  • Marc Zeitoun

We study an operator on classes of languages. For each class π’ž, it produces a new class FOΒ²(𝕀_π’ž) associated with a variant of two-variable first-order logic equipped with a signature 𝕀_π’ž built from π’ž. For π’ž = {βˆ…, A*}, we obtain the usual FOΒ²(<)} logic, equipped with linear order. For π’ž = {βˆ…, {Ξ΅}, A+, A*}, we get the variant FOΒ²(<, +1), which also includes the successor predicate. If π’ž consists of all Boolean combinations of languages A*aA*, where a is a letter, we get the variant FOΒ²(<, Bet), which includes "between" relations. We prove a generic algebraic characterization of the classes FO^2(𝕀_π’ž). It elegantly generalizes those known for all the cases mentioned above. Moreover, it implies that if π’ž has decidable separation (plus some standard properties), then FOΒ²2(𝕀_π’ž) has a decidable membership problem. We actually work with an equivalent definition of FOΒ²(𝕀_π’ž) in terms of unary temporal logic. For each class π’ž, we consider a variant TL(π’ž) of unary temporal logic whose future/past modalities depend on π’ž and such that TL(π’ž) = FOΒ²(𝕀_π’ž). Finally, we also characterize FL(π’ž) and PL(π’ž), the pure-future and pure-past restrictions of TL(π’ž). Like for TL(π’ž), these characterizations imply that if π’ž is a class with decidable separation, then FL(π’ž) and PL(π’ž) have decidable membership.

MFCS Conference 2016 Conference Paper

The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics

  • Thomas Place
  • Marc Zeitoun

An important endeavor in computer science is to precisely understand the expressive power of logical formalisms over discrete structures, such as words. Naturally, "understanding" is not a mathematical notion. Therefore, this investigation requires a concrete objective to capture such a notion. In the literature, the standard choice for this objective is the membership problem, whose aim is to find a procedure deciding whether an input regular language can be defined in the logic under study. This approach was cemented as the "right" one by the seminal work of Schuetzenberger, McNaughton and Papert on first-order logic and has been in use since then. However, membership questions are hard: for several important fragments, researchers have failed in this endeavor despite decades of investigation. In view of recent results on one of the most famous open questions, namely the quantifier alternation hierarchy of first-order logic, an explanation may be that membership is too restrictive as a setting. These new results were indeed obtained by considering more general problems than membership, taking advantage of the increased flexibility of the enriched mathematical setting. This opens a promising avenue of research and efforts have been devoted at identifying and solving such problems for natural fragments. However, until now, these problems have been ad hoc, most fragments relying on a specific one. A unique new problem replacing membership as the right one is still missing. The main contribution of this paper is a suitable candidate to play this role: the Covering Problem. We motivate this problem with three arguments. First, it admits an elementary set theoretic formulation, similar to membership. Second, we are able to reexplain or generalize all known results with this problem. Third, we develop a mathematical framework as well as a methodology tailored to the investigation of this problem.

Highlights Conference 2014 Conference Abstract

Going Higher in the First-order Quantifier Alternation Hierarchy on Words

  • Thomas Place

I will present new results on the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. A famous open problem in formal language theory is to find decidable characterizations for every level. That is an algorithm which, given as input a regular language, decides it can be expressed by a formula of the level in question. For a long time this problem has been open for every level above level 3/2 (formulas having only 1 alternation). In the talk, I will present techniques for obtaining decidable characterizations for levels 2 (boolean combinations of formulas having only 1 alternation) and 5/2 (formulas having 2 alternations). The techniques work by considering a deeper problem, called separation, which, once solved for lower levels, allows to obtain decidable characterizations for higher levels.

Highlights Conference 2013 Conference Abstract

Separating regular languages by piecewise testable and unambiguous languages

  • Thomas Place
  • Lorijn van Rooijen
  • Marc Zeitoun

We discuss the separation problem for regular languages. We give a Ptime algorithm to check whether two given regular languages are separable by a piecewise testable language, that is, whether a $\mathcal{B}\Sigma_1(<)$ sentence can witness that the languages are disjoint. If this is possible, we express a separator by saturating one of the original languages by a suitable congruence. Following the same line, we show that one can also decide whether two regular languages can be separated by an unambiguous (i. e. $FO^2(<)$-definable) language, albeit with a higher complexity.

MFCS Conference 2013 Conference Paper

Separating Regular Languages by Piecewise Testable and Unambiguous Languages

  • Thomas Place
  • Lorijn van Rooijen
  • Marc Zeitoun

Abstract Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from another class. We discuss the separation problem for regular languages. We give a Ptime algorithm to check whether two given regular languages are separable by a piecewise testable language, that is, whether a \(\mathcal{B}\Sigma_1(<)\) sentence can witness that the languages are disjoint. The proof refines an algebraic argument from Almeida and the third author. When separation is possible, we also express a separator by saturating one of the original languages by a suitable congruence. Following the same line, we show that one can as well decide whether two regular languages can be separated by an unambiguous language, albeit with a higher complexity.

MFCS Conference 2010 Conference Paper

Frame Definability for Classes of Trees in the Β΅ -calculus

  • GaΓ«lle Fontaine
  • Thomas Place

Abstract We are interested in frame definability of classes of trees, using formulas of the ΞΌ -calculus. In this set up, the proposition letters (or in other words, the free variables) in the ΞΌ -formulas correspond to second order variables over which universally quantify. Our main result is a semantic characterization of the MSO definable classes of trees that are definable by a ΞΌ -formula. We also show that it is decidable whether a given MSO formula corresponds to a ΞΌ -formula, in the sense that they define the same class of trees.

CSL Conference 2008 Conference Paper

Characterization of Logics over Ranked Tree Languages

  • Thomas Place

Abstract We study the expressive power of the logics EF + F βˆ’ 1, Ξ” 2 and boolean combinations of Ξ£ 1 over ranked trees. In particular, we provide effective characterizations of those three logics using algebraic identities. Characterizations had already been obtained for those logics over unranked trees, but both the algebra and the proofs were dependant on the properties of the unranked structure and the problem remained open for ranked trees.

v2026.09.13