Reasoning About Substructures and Games (Q2957764): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2757286 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2271301048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local equilibria in economic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substructure Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enriched Mu-Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures and expressiveness in the temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about information change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about equilibria in game-like concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of quantifiers is better than number of tape cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5339289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to branching-time model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Module checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching-Time Temporal Logics with Minimal Model Quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning About Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in computer science. A study on extensions of temporal and strategic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Behavioral Hierarchy of Strategy Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting on CTL\(^*\): On the expressive power of monadic path logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics of public communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The temporal semantics of concurrent programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940830 / 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: Q2844043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complementation problem for Büchi automata with applications to temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing Mathematical Reasoning / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:07, 13 July 2024

scientific article
Language Label Description Also known as
English
Reasoning About Substructures and Games
scientific article

    Statements

    Reasoning About Substructures and Games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 January 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references