Verifying agents with memory is harder than it seemed

DOI10.3233/AIC-2010-0481zbMath1216.68257OpenAlexW1907048110MaRDI QIDQ3000379

Wojciech Jamroga, Nils Bulling

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

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

Related Items (4)

Norm-based mechanism design ⋮ Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability ⋮ Natural strategic ability

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