Reasoning about graded strategy quantifiers

DOI10.1016/J.IC.2017.08.010MaRDI QIDQ1706169zbMATH OpenOpenAlexFDO

Authors Vadim Malvone, Fabio Mogavero, Aniello Murano, Loredana Sorrentino

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

zbMATH Keywords

strategic reasoningcounting quantifiersstrategy logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42) (n)-person games, (n>2) (91A06)

Recommendations

• Graded modalities in strategy logic
• Reasoning about strategies: on the satisfiability problem
• Strategy logic
• Strategy Logic
• On the boundary of behavioral strategies

Cites work

• scientific article; zbMATH DE number 1633145 (Why is no real title available?)
• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 3930354 (Why is no real title available?)
• scientific article; zbMATH DE number 3757688 (Why is no real title available?)
• scientific article; zbMATH DE number 49749 (Why is no real title available?)
• scientific article; zbMATH DE number 3993574 (Why is no real title available?)
• scientific article; zbMATH DE number 2090317 (Why is no real title available?)
• scientific article; zbMATH DE number 2196601 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• scientific article; zbMATH DE number 3212004 (Why is no real title available?)
• A behavioral hierarchy of strategy logic
• ATL with Strategy Contexts and Bounded Memory
• ATL with strategy contexts: expressiveness and model checking
• Alternating-time temporal logic
• Borel determinacy
• Enriched MU-Calculi Module Checking
• Formal verification of parallel programs
• Graded Computation Tree Logic with Binary Coding
• Graded alternating-time temporal logic
• Graded computation tree logic
• In so many possible worlds
• Model checking for graded CTL
• Module checking
• Mutation-selection equilibrium in games with multiple strategies
• Number of quantifiers is better than number of tape cells
• On CTL* with Graded Path Modalities
• On promptness in parity games
• Pushdown module checking with imperfect information
• Reasoning about strategies
• Reasoning about strategies: on the model-checking problem
• Strategy Logic
• The complexity of finite model reasoning in description logics
• What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
• mcmas: A Model Checker for Multi-agent Systems
• “Sometimes” and “not never” revisited

Cited in

(5)

• Model-checking graded computation-tree logic with finite path semantics
• Sublogics of a branching time logic of robustness
• CTL^ with graded path modalities
• Strategies of the search for derivation of statements with restricted quantifiers
• Graded modalities in strategy logic

Describes a project that uses

Uses Software

• MCMAS-SLK
• MCMAS

This page was built for publication: Reasoning about graded strategy quantifiers

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