On Composing Finite Forests with Modal Logics

DOI10.1145/3569954MaRDI QIDQ5886519zbMATH OpenOpenAlexWikidataFDO

Authors Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti

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 powergraded modal logicmodal logic on treesseparation logicstatic ambient logic

Mathematics Subject Classification ID

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

Cites work

• `Knowable' as `known after an announcement'
• A modal separation logic for resource dynamics
• A note on graded modal logic
• Adjunct elimination in context logic for trees
• Adjuncts elimination in the static ambient logic
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
• Automata-theoretic techniques for modal logics of programs
• BI as an assertion language for mutable data structures
• Complexity hierarchies beyond elementary
• Complexity of modal logics with Presburger constraints
• Complexity of propositional logics in team semantic
• Context logic and tree update
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Deciding validity in a spatial logic for trees
• Elements of finite model theory.
• Expressiveness and complexity of graph logic
• Extending propositional separation logic for robustness properties
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Global and local graph modifiers
• Graded modalities. I
• scientific article; zbMATH DE number 5949231 (Why is no real title available?)
• scientific article; zbMATH DE number 3688686 (Why is no real title available?)
• scientific article; zbMATH DE number 1048047 (Why is no real title available?)
• scientific article; zbMATH DE number 1841809 (Why is no real title available?)
• scientific article; zbMATH DE number 7577569 (Why is no real title available?)
• scientific article; zbMATH DE number 3408928 (Why is no real title available?)
• Internal proof calculi for modal logics with separating conjunction
• Modal logic
• Modal logics of sabotage revisited
• Modal logics with composition on finite forests: expressivity and complexity
• Moving Arrows and Four Model Checking Results
• On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
• Presburger arithmetic with bounded quantifier alternation
• Propositional quantifiers in modal logic1
• PSPACE bounds for rank-1 modal logics
• PSpace reasoning for graded modal logics
• Quantified CTL: expressiveness and complexity
• Reasoning about infinite computations
• Relation-changing modal operators
• The Bernays-Schönfinkel-Ramsey class of separation logic with uninterpreted predicates
• The complexity of one-agent refinement modal logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The fluted fragment revisited
• The power of modal separation logics
• The semantics and proof theory of the logic of bunched implications
• The semantics of BI and resource tableaux

Cited in

(2)

• Finite approximability of forest superintuitionistic logics
• NP trees and Carnap's modal logic

This page was built for publication: On Composing Finite Forests with Modal Logics

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