Satisfiability of a Spatial Logic with Tree Variables

DOI10.1007/978-3-540-74915-8_13MaRDI QIDQ3608409zbMATH OpenOpenAlexFDO

Authors Emmanuel Filiot, Jean-Marc Talbot, 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

Mathematics Subject Classification ID

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

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

Cited in

(9)

• Satisfiability of compositional separation logic with tree predicates and data constraints
• Deciding validity in a spatial logic for trees
• On the Computational Complexity of Spatial Logics with Connectedness Constraints
• scientific article; zbMATH DE number 7559156 (Why is no real title available?)
• Tree Automata with Global Constraints
• Rigid Tree Automata
• scientific article; zbMATH DE number 2081098 (Why is no real title available?)
• scientific article; zbMATH DE number 2163033 (Why is no real title available?)
• Rigid tree automata and applications

Describes a project that uses

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)