The complexity of achievement and maintenance problems in agent-based systems
DOI10.1016/S0004-3702(03)00014-6zbMATH Open1082.68578OpenAlexW2025821071MaRDI QIDQ814461FDOQ814461
Authors: Iain 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
Recommendations
Agent-based systemsComputational complexityAchievement agent design problemsMaintenance agent design problems
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- The complexity of propositional linear temporal logics
- Title not available (Why is that?)
- The computational complexity of propositional STRIPS planning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classical recursion theory. Vol. II
- Title not available (Why is that?)
- Computational complexity of planning and approximate planning in the presence of incompleteness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- The computational complexity of scenario-based agent verification and design
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- The complexity of agent design problems: Determinism and history dependence
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The complexity of achievement and maintenance problems in agent-based systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814461)
