Plan logic

DOI10.4230/LIPICS.FSTTCS.2024.9MaRDI QIDQ7263566zbMATH OpenFDO

Authors Dylan Bellier, Massimo Benerecetti, Fabio Mogavero, Sophie Pinchinat

Publication date 12 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2024.9

zbMATH Keywords

hyperteam semanticslogic for strategic reasoningrealisable strategiesstrategies vs. plansstrategy logic

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• Alternating (in)dependence-friendly logic
• Alternating-time temporal logic
• Alternating-time temporal logic
• An automata-theoretic approach to branching-time model checking
• ATL* Satisfiability Is 2EXPTIME-Complete
• Compositional semantics for a language of imperfect information
• Dependence logic. A new approach to independence friendly logic
• Dependences in strategy logic
• Dependences in strategy logic
• Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
• Good-for-Game QPTL: An Alternating Hodges Semantics
• scientific article; zbMATH DE number 6863862 (Why is no real title available?)
• Reasoning about strategies
• Reasoning about strategies: on the model-checking problem
• Reasoning about strategies: on the satisfiability problem
• Strategy logic
• Strategy Logic
• The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games
• Weighted Strategy Logic with Boolean Goals Over One-Counter Games.

This page was built for publication: Plan logic

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