The complexity of agent design problems: Determinism and history dependence

DOI10.1007/S10472-005-9003-0zbMATH Open1103.68104OpenAlexW2043460784MaRDI QIDQ2502156FDOQ2502156

Paul E. Dunne, M. J. 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

zbMATH Keywords

computational complexityautonomous agentsdecision problems

Mathematics Subject Classification ID

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
• STRIPS: A new approach to the application of theorem proving to problem solving
• The complexity of propositional linear temporal logics
• The computational complexity of propositional STRIPS planning
• The complexity of facets (and some facets of complexity)
• 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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• The computational complexity of scenario-based agent verification and design

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)