The complexity of agent design problems: Determinism and history dependence (Q2502156): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational complexity of planning and approximate planning in the presence of incompleteness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of propositional STRIPS planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STRIPS: A new approach to the application of theorem proving to problem solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and acting in partially observable stochastic domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank

Latest revision as of 20:07, 24 June 2024

scientific article
Language Label Description Also known as
English
The complexity of agent design problems: Determinism and history dependence
scientific article

    Statements

    The complexity of agent design problems: Determinism and history dependence (English)
    0 references
    0 references
    0 references
    12 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    autonomous agents
    0 references
    computational complexity
    0 references
    decision problems
    0 references
    0 references