On Composing Finite Forests with Modal Logics

DOI10.1145/3569954OpenAlexW4313254506MaRDI QIDQ5886519

Bartosz Bednarczyk, Alessio Mansutti, Stéphane P. Demri, Raul Fervari

Publication date: 5 April 2023

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3569954

zbMATH Keywords

complexityexpressive powerseparation logicgraded modal logicmodal logic on treesstatic ambient logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• The complexity of one-agent refinement modal logic
• Expressiveness and complexity of graph logic
• Adjunct elimination in context logic for trees
• Graded modalities. I
• Automata-theoretic techniques for modal logics of programs
• Reasoning about infinite computations
• A note on graded modal logic
• The semantics and proof theory of the logic of bunched implications
• Complexity of modal logics with Presburger constraints
• PSPACE Reasoning for Graded Modal Logics
• Complexity Hierarchies beyond Elementary
• Moving Arrows and Four Model Checking Results
• Quantified CTL: Expressiveness and Complexity
• PSPACE bounds for rank-1 modal logics
• Deciding validity in a spatial logic for trees
• The semantics of BI and resource tableaux
• Internal proof calculi for modal logics with separating conjunction
• ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
• Propositional quantifiers in modal logic1
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Complexity of Propositional Logics in Team Semantic
• Modal logics of sabotage revisited
• A modal separation logic for resource dynamics
• Relation-changing modal operators: Fig. 1.
• Global and Local Graph Modifiers
• The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates
• Modal Logics with Composition on Finite Forests
• BI as an assertion language for mutable data structures
• THE FLUTED FRAGMENT REVISITED
• The power of modal separation logics
• Context logic and tree update
• Presburger arithmetic with bounded quantifier alternation
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Decidability of Second-Order Theories and Automata on Infinite Trees
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning