Location of Repository

Two-variable logic on data words

By Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick and Luc Segoufin

Abstract

International audienceIn a data word each position carries a label from a finite alphabet and a data value from some infinite domain. This model has been already considered in the realm of semistructured data, timed automata and extended temporal logics. This paper shows that satisfiability for the two-variable fragment FO2(∼,<,+1) of first-order logic with data equality test ∼, is decidable over finite and over infinite data words. Here, +1 and < are the usual successor and order predicates, respectively. The satisfiability problem is shown to be at least as hard as reachability in Petri nets. Several extensions of the logic are considered, some remain decidable while some are undecidable

Topics: [ INFO.INFO-OH ] Computer Science [cs]/Other [cs.OH]
Publisher: Association for Computing Machinery
Year: 2011
OAI identifier: oai:HAL:hal-00645452v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.