Reasoning about graded strategy quantifiers
From MaRDI portal
Publication:1706169
DOI10.1016/j.ic.2017.08.010zbMath1390.68612OpenAlexW2767103995MaRDI QIDQ1706169
Loredana Sorrentino, Aniello Murano, Fabio Mogavero, Vadim Malvone
Publication date: 21 March 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2017.08.010
Logic in artificial intelligence (68T27) (n)-person games, (n>2) (91A06) Agent technology and artificial intelligence (68T42)
Related Items (4)
Graded modalities in strategy logic ⋮ Sublogics of a branching time logic of robustness ⋮ CTL\(^\ast\) with graded path modalities ⋮ Model-checking graded computation-tree logic with finite path semantics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Number of quantifiers is better than number of tape cells
- Borel determinacy
- Mutation-selection equilibrium in games with multiple strategies
- Module checking
- Pushdown module checking with imperfect information
- The complexity of finite model reasoning in description logics
- In so many possible worlds
- On Promptness in Parity Games
- What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
- A Behavioral Hierarchy of Strategy Logic
- Graded computation tree logic
- Reasoning About Strategies
- Model Checking for Graded CTL
- mcmas: A Model Checker for Multi-agent Systems
- Alternating-time temporal logic
- On CTL* with Graded Path Modalities
- Strategy Logic
- Enriched MU-Calculi Module Checking
- Graded Computation Tree Logic with Binary Coding
- ATL with Strategy Contexts and Bounded Memory
- “Sometimes” and “not never” revisited
- Formal verification of parallel programs
- Graded Alternating-Time Temporal Logic
This page was built for publication: Reasoning about graded strategy quantifiers
