The complexity of achievement and maintenance problems in agent-based systems
From MaRDI portal
Publication:814461
Recommendations
Cites work
- scientific article; zbMATH DE number 46423 (Why is no real title available?)
- scientific article; zbMATH DE number 1216123 (Why is no real title available?)
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 2080340 (Why is no real title available?)
- scientific article; zbMATH DE number 1759606 (Why is no real title available?)
- scientific article; zbMATH DE number 2088153 (Why is no real title available?)
- Classical recursion theory. Vol. II
- Computational complexity of planning and approximate planning in the presence of incompleteness
- The complexity of propositional linear temporal logics
- The computational complexity of propositional STRIPS planning
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
- scientific article; zbMATH DE number 2080340 (Why is no real title available?)
- scientific article; zbMATH DE number 2088153 (Why is no real title available?)
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)