Satisfiability of a Spatial Logic with Tree Variables

DOI10.1007/978-3-540-74915-8_13zbMATH Open1179.03036OpenAlexW1517909403MaRDI QIDQ3608409FDOQ3608409

Jean-Marc Talbot, Emmanuel Filiot, Sophie Tison

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_13

Recommendations

• scientific article; zbMATH DE number 2163033
• Two-variable logic on data trees and XML reasoning
• Complexity of two-variable logic on finite trees
• scientific article; zbMATH DE number 2219131
• Deciding validity in a spatial logic for trees

Mathematics Subject Classification ID

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

Cited In (9)

• Satisfiability of compositional separation logic with tree predicates and data constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tree Automata with Global Constraints
• On the Computational Complexity of Spatial Logics with Connectedness Constraints
• Rigid tree automata and applications
• Rigid Tree Automata
• Title not available (Why is that?)
• Deciding validity in a spatial logic for trees

Uses Software

• CDuce
• XDuce

This page was built for publication: Satisfiability of a Spatial Logic with Tree Variables

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