The complexity of achievement and maintenance problems in agent-based systems

DOI10.1016/S0004-3702(03)00014-6zbMath1082.68578OpenAlexW2025821071MaRDI QIDQ814461

Iain A. Stewart

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(03)00014-6

zbMATH Keywords

Computational complexityAgent-based systemsAchievement agent design problemsMaintenance agent design problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

The computational complexity of scenario-based agent verification and design

Cites Work

• Classical recursion theory. Vol. II
• The computational complexity of propositional STRIPS planning
• Computational complexity of planning and approximate planning in the presence of incompleteness
• The complexity of propositional linear temporal logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of achievement and maintenance problems in agent-based systems