The complexity of agent design problems: Determinism and history dependence
From MaRDI portal
Publication:2502156
DOI10.1007/s10472-005-9003-0zbMath1103.68104OpenAlexW2043460784MaRDI QIDQ2502156
Paul E. Dunne, Michael Wooldridge
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
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) General topics in artificial intelligence (68T01)
Cites Work
- Planning and acting in partially observable stochastic domains
- The complexity of facets (and some facets of complexity)
- The computational complexity of propositional STRIPS planning
- Computational complexity of planning and approximate planning in the presence of incompleteness
- STRIPS: A new approach to the application of theorem proving to problem solving
- The complexity of propositional linear temporal logics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The complexity of agent design problems: Determinism and history dependence