Future-Looking Logics on Data Words and Trees

DOI10.1007/978-3-642-03816-7_29zbMath1250.03050OpenAlexW1575080936MaRDI QIDQ3182936

Diego Figueira, Luc Segoufin

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_29

Mathematics Subject Classification ID

Logic in computer science (03B70) Data structures (68P05) Temporal logic (03B44)

Related Items (6)

Unnamed Item ⋮ Separation logics and modalities: a survey ⋮ Logics of Repeating Values on Data Trees and Branching Counter Systems ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Complexity Hierarchies beyond Elementary

Uses Software

• XPath

Cites Work

• Unnamed Item
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• An algebraic approach to data languages and timed languages
• Verifying lossy channel systems has nonprimitive recursive complexity.
• LTL with the freeze quantifier and register automata
• Two-variable logic on data words
• Two-variable logic on data trees and XML reasoning
• XPath satisfiability in the presence of DTDs
• Optimizing Conjunctive Queries over Trees Using Schema Information
• Complexity of Data Tree Patterns over XML Documents
• Database Programming Languages
• Foundations of Software Science and Computation Structures

This page was built for publication: Future-Looking Logics on Data Words and Trees