See this document in CiteSeerX!

On the Computational Complexity of Designing Bounded Agents (2003)  (Make Corrections)  
Michael Laurence, Paul E. Dunne, Michael Wooldridge



  Home/Search   Context   Related

 
View or download:
csc.liv.ac.uk/researc...ulcs03020.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  csc.liv.ac.uk/research/techrep... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper, we determine the computational complexity of the agent design problem for several classes of bounded agents. Agent design is the problem of determining, for a given representation of an environment and representation of a task to be carried out in this environment, whether it is possible to construct an agent that can be guaranteed to accomplish the task in the environment. Previous research has determined the complexity of the agent design problem for various classes of... (Update)

Similar documents (at the sentence level):
10.9%:   The Computational Complexity of Boolean and Stochastic.. - Dunne, Wooldridge.. (2002)   (Correct)
10.9%:   Complexity Results for Agent Design Problems - Dunne, Laurence, Wooldridge (2003)   (Correct)

Active bibliography (related documents):   More   All
0.0:   The Complexity of Agent Design Problems: Determinism and.. - Wooldridge, Dunne (2001)   (Correct)
0.0:   The Computational Complexity of Agent Verification - Wooldridge, Dunne (2001)   (Correct)
0.0:   Optimistic and Disjunctive Agent Design Problems - Wooldridge, Dunne (2000)   (Correct)

Similar documents based on text:   More   All
0.5:   The Complexity of Contract Negotiation - Dunne, Wooldridge, Laurence (2003)   (Correct)
0.2:   Qualitative Coalitional Reasoning with Preferences - Dunne, Wooldridge (2004)   (Correct)
0.2:   TPI-Disputes and Proof by Clausal Tableaux - Dunne (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ laurence-computational,
  author = "Michael Laurence and Paul E. Dunne and Michael Wooldridge",
  title = "On the Computational Complexity of Designing Bounded Agents",
  url = "citeseer.ist.psu.edu/laurence03computational.html" }
Citations (may not include all citations):
951   Computational Complexity (context) - Papadimitriou - 1994
331   Logical Foundations of Artificial Intelligence (context) - Genesereth, Nilsson - 1987
213   Universal plans for reactive robots in unpredictable environ.. - Schoppers - 1987
77   Provably bounded-optimal agents - Russell, Subramanian - 1995
47   universally bad idea (context) - Ginsberg, An - 1989
39   Modeling Bounded Rationality (context) - Rubinstein - 1998
22   Cambrian Intelligence (context) - Brooks - 1999
17   The computational complexity of agent design problems - Wooldridge - 2000
3   The complexity of agent design problems: determinism and his.. - Wooldridge, Dunne - 2001
2   The computational complexity of boolean and stochastic agent.. - Dunne, Wooldridge et al. - 2002
1   Complete sets for the polynomial hierarchy (context) - Wrathall - 1976

Documents on the same site (http://www.csc.liv.ac.uk/research/techreports/):   More
Chance Discovery and Scenario Analysis - McBurney, Parsons (2002)   (Correct)
TPI-Disputes and Proof by Clausal Tableaux - Dunne (2002)   (Correct)
A Language for Exchanging Agent UML Protocol Diagrams - Huget (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC