Pebble-intervals automata and FO^2 with two orders

DOI10.1007/978-3-030-40608-0_14MaRDI QIDQ782576zbMATH OpenOpenAlexFDO

Authors Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith

Publication date 27 July 2020

Full work available at URL https://arxiv.org/abs/1912.00171

zbMATH Keywords

decidabilitydata wordstwo-variable fragmentautomata and logicemptiness testingpebble-intervals automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Abstract: We introduce a novel automata model, called pebble-intervals automata (PIA), and study its power and closure properties. PIAs are tailored for a decidable fragment of FO that is important for reasoning about structures that use data values from infinite domains: the two-variable fragment with one total preorder and its induced successor relation, one linear order, and an arbitrary number of unary relations. We prove that the string projection of every language of data words definable in the logic is accepted by a pebble-intervals automaton A, and obtain as a corollary an automata-theoretic proof of the EXPSPACE upper bound for finite satisfiability due to Schwentick and Zeume.

Recommendations

• Two-variable logic on 2-dimensional structures
• Two-variable logic on data words
• Two-variable logic with two order relations (extended abstract)
• Feasible automata for two-variable logic with successor on data words
• Two-variable logic with two order relations

Cited in

(2)

• On pebble automata for data languages with decidable emptiness problem
• Two-variable logic on 2-dimensional structures

This page was built for publication: Pebble-intervals automata and \(\text{FO}^2\) with two orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782576)