The complexity of agent design problems: Determinism and history dependence

DOI10.1007/S10472-005-9003-0MaRDI QIDQ2502156zbMATH OpenOpenAlexFDO

Authors M. J. Wooldridge, Paul E. Dunne

Publication date 12 September 2006

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-005-9003-0

zbMATH Keywords

autonomous agentscomputational complexitydecision problems

Mathematics Subject Classification ID

Logic in computer science (03B70) Analysis of algorithms and problem complexity (68Q25) General topics in artificial intelligence (68T01)

Recommendations

• The complexity of achievement and maintenance problems in agent-based systems
• scientific article; zbMATH DE number 2080340
• scientific article; zbMATH DE number 2088153
• Heterogeneous active agents, II: Algorithms and complexity
• Agent planning programs

Cites work

• Computational complexity of planning and approximate planning in the presence of incompleteness
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 3555903 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1216123 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1149416 (Why is no real title available?)
• scientific article; zbMATH DE number 868107 (Why is no real title available?)
• scientific article; zbMATH DE number 225477 (Why is no real title available?)
• Planning and acting in partially observable stochastic domains
• STRIPS: A new approach to the application of theorem proving to problem solving
• The complexity of facets (and some facets of complexity)
• The complexity of propositional linear temporal logics
• The computational complexity of propositional STRIPS planning

Cited in

(6)

• Heterogeneous active agents, II: Algorithms and complexity
• The computational complexity of scenario-based agent verification and design
• scientific article; zbMATH DE number 2080340 (Why is no real title available?)
• scientific article; zbMATH DE number 1756657 (Why is no real title available?)
• scientific article; zbMATH DE number 2088153 (Why is no real title available?)
• The complexity of achievement and maintenance problems in agent-based systems

This page was built for publication: The complexity of agent design problems: Determinism and history dependence

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