Logics for unordered trees with data constraints

DOI10.1016/J.JCSS.2018.11.004MaRDI QIDQ2424682zbMATH OpenOpenAlexWikidataFDO

Authors Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen

Publication date 25 June 2019

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01176763/file/0.pdf

zbMATH Keywords

counting MSOdata treesstring comparisons

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Data structures (68P05) Database theory (68P15)

Recommendations

• Logics for Unordered Trees with Data Constraints on Siblings
• Extending two-variable logic on data trees with order on data values and its automata
• An automata model for trees with ordered data values
• Automata, Languages and Programming
• Unranked Tree Automata with Sibling Equalities and Disequalities

Cites work

• A complete and recursive feature theory
• Automata for unordered trees
• Counting in trees
• Equality and disequality constraints on direct subterms in tree automata
• Feature automata and recognizable sets of feature trees
• Feature-constraint logics for unification grammars
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Graph structure and monadic second-order logic. A language-theoretic approach
• scientific article; zbMATH DE number 3492660 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 2043533 (Why is no real title available?)
• scientific article; zbMATH DE number 1392285 (Why is no real title available?)
• Logics for Unordered Trees with Data Constraints on Siblings
• Mathematical Foundations of Computer Science 2004
• Model checking languages of data words
• Monadic second order definable relations on the binary tree
• Ordering constraints over feature trees expressed in second-order monadic logic.
• Records for logic programming
• Static and dynamic semantics of NoSQL languages
• Term Rewriting and Applications
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Two-variable logic on data words
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(9)

• Ordered model trees: A normal form for disjunctive deductive databases
• Static analysis and query answering for incomplete data trees with constraints
• Satisfiability of compositional separation logic with tree predicates and data constraints
• Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015
• Logics for Unordered Trees with Data Constraints on Siblings
• Logical definability and query languages over ranked and unranked trees
• Automata, Languages and Programming
• Presburger Büchi tree automata with applications to logics with expressive counting
• Reasoning About Data Trees Using CHCs

This page was built for publication: Logics for unordered trees with data constraints

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