PDL for ordered trees

DOI10.3166/JANCL.15.115-135MaRDI QIDQ3647225zbMATH OpenOpenAlexWikidataFDO

Authors Loredana Afanasiev, Patrick Blackburn, Ioanna Matilde Dimitriou, Bertrand Gaiffe, Evan Goris, Maarten Marx, Maarten de Rijke

Publication date 30 November 2009

Published in Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3166/jancl.15.115-135

zbMATH Keywords

complexitydefinabilityexpressivitypropositional dynamic logicordered trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• Highly expressive query languages for unordered data trees
• scientific article; zbMATH DE number 1759452
• Database Theory - ICDT 2005
• scientific article; zbMATH DE number 1950751
• Logics and Automata for Totally Ordered Trees

Cites work

• scientific article; zbMATH DE number 757645 (Why is no real title available?)
• scientific article; zbMATH DE number 1447282 (Why is no real title available?)
• A Modal Perspective on Path Constraints
• Automata-theoretic techniques for modal logics of programs
• Decidability of S1S and S2S
• Handbook of philosophical logic. Volume II: Extensions of classical logic
• Linguistics, Logic and Finite Trees
• Propositional dynamic logic of regular programs
• Reachability logic: an efficient fragment of transitive closure logic
• Syntactic codes and grammar refinement

Cited in

(7)

• PDL with intersection and converse: satisfiability and infinite-state model checking
• Inessential features, ineliminable features, and modal logics for model theoretic syntax
• Complexity of modal logics with Presburger constraints
• 2-Exp Time lower bounds for propositional dynamic logics with intersection
• Complexity of hybrid logics over transitive frames
• Efficiently deciding -calculus with converse over finite trees
• Operator precedence languages: their automata-theoretic and logic characterization

This page was built for publication: PDL for ordered trees

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