Systems of agents controlled by logical programs: complexity of verification
From MaRDI portal
Publication:1040334
DOI10.1134/S036176880905003XzbMath1187.68626MaRDI QIDQ1040334
M. K. Valiev, Michael I. Dekhtyar, Alexander Dikovsky
Publication date: 24 November 2009
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s036176880905003x
68Q60: Specification and verification (program logics, model checking, etc.)
68T42: Agent technology and artificial intelligence
Related Items
Uses Software
Cites Work
- Results on the propositional \(\mu\)-calculus
- On feasible cases of checking multi-agent systems behavior.
- MetateM: An introduction
- Heterogeneous active agents. III: Polynomially implementable agents
- On complexity of verification of interacting agents' behavior
- The complexity of propositional linear temporal logics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item