The computational complexity of agent verification

DOI10.1007/3-540-45448-9_9MaRDI QIDQ4739289zbMATH OpenFDO

Authors M. J. Wooldridge, Paul E. Dunne

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2333/23330115.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Recommendations

• The complexity of agent design problems: Determinism and history dependence
• The complexity of achievement and maintenance problems in agent-based systems
• Systems of agents controlled by logical programs: complexity of verification
• On complexity of verification of interacting agents' behavior
• Optimistic and disjunctive agent design problems

Cited in

(9)

• Complexity of the problem of verifying the coordination mechanism in a system of software support of network collaboration
• Systems of agents controlled by logical programs: complexity of verification
• The computational complexity of scenario-based agent verification and design
• On complexity of verification of interacting agents' behavior
• The complexity of agent design problems: Determinism and history dependence
• Optimistic and disjunctive agent design problems
• Two-stage agent program verification
• scientific article; zbMATH DE number 7324611 (Why is no real title available?)
• The complexity of achievement and maintenance problems in agent-based systems

This page was built for publication: The computational complexity of agent verification

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