Heterogeneous active agents, II: Algorithms and complexity

DOI10.1016/S0004-3702(99)00006-5MaRDI QIDQ1285675zbMATH OpenOpenAlexFDO

Authors Thomas Eiter, V. S. Subrahmanian

Publication date 28 April 1999

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0004-3702(99)00006-5

zbMATH Keywords

algorithmscomputational complexityagent languagessoftware agents

Mathematics Subject Classification ID

Knowledge representation (68T30) Theory of software (68N99) Semantics in the theory of computing (68Q55)

Recommendations

• Heterogeneous active agents. III: Polynomially implementable agents
• Heterogeneous active agents, I: Semantics
• The complexity of agent design problems: Determinism and history dependence
• scientific article; zbMATH DE number 1969725

Cited in

(9)

• scientific article; zbMATH DE number 1969725 (Why is no real title available?)
• From P Colonies to 2D P Colonies and Simulations of Multiagent Systems
• Improving performance of heterogeneous agents
• Intelligent Versus Random Beavers—an Agent‐Based Approach in Facing the Busy Beaver Problem
• The complexity of agent design problems: Determinism and history dependence
• Temporal agent programs
• Finding similar/diverse solutions in answer set programming
• Heterogeneous active agents. III: Polynomially implementable agents
• The complexity of achievement and maintenance problems in agent-based systems

This page was built for publication: Heterogeneous active agents, II: Algorithms and complexity

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