Verifying agents with memory is harder than it seemed

DOI10.3233/AIC-2010-0481MaRDI QIDQ3000379zbMATH OpenOpenAlexFDO

Authors Nils Bulling, Wojciech Jamroga

Publication date 18 May 2011

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-2010-0481

zbMATH Keywords

complexitymodel checkingstrategic logic

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42) Temporal logic (03B44)

Recommendations

• Alternating-time temporal logic with finite-memory strategies
• Model checking abilities of agents: a closer look
• ATL with Strategy Contexts and Bounded Memory
• On the Expressiveness and Complexity of ATL
• On the Expressiveness and Complexity of ATL

Cited in

(5)

• Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
• scientific article; zbMATH DE number 7453151 (Why is no real title available?)
• Norm-based mechanism design
• Natural strategic ability
• Strategic reasoning with a bounded number of resources: the quest for tractability

This page was built for publication: Verifying agents with memory is harder than it seemed

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