On Composing Finite Forests with Modal Logics (Q5886519): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Add wikidata reference.
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/3569954 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4313254506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moving Arrows and Four Model Checking Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation-changing modal operators: Fig. 1. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and Local Graph Modifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal logics of sabotage revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graded modalities. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5101338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal Logics with Composition on Finite Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3384161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of one-agent refinement modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding validity in a spatial logic for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjunct elimination in context logic for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context logic and tree update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3169433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modal separation logic for resource dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness and complexity of graph logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graded modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of modal separation logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal proof calculi for modal logics with separating conjunction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of modal logics with Presburger constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional quantifiers in modal logic1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semantics of BI and resource tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Propositional Logics in Team Semantic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BI as an assertion language for mutable data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified CTL: Expressiveness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE FLUTED FRAGMENT REVISITED / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semantics and proof theory of the logic of bunched implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger arithmetic with bounded quantifier alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Hierarchies beyond Elementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE bounds for rank-1 modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE Reasoning for Graded Modal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-theoretic techniques for modal logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130826230 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:34, 16 December 2024

scientific article; zbMATH DE number 7672671
Language Label Description Also known as
English
On Composing Finite Forests with Modal Logics
scientific article; zbMATH DE number 7672671

    Statements

    On Composing Finite Forests with Modal Logics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 April 2023
    0 references
    modal logic on trees
    0 references
    separation logic
    0 references
    static ambient logic
    0 references
    graded modal logic
    0 references
    expressive power
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references