article · 2008

Assessing the Complexity of Plan Recognition

Cited by 0Abstract and details only

Abstract

This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition algorithm must consider given various properties of the plan library. On the basis of these results it points out properties of plan libraries that make them computationally expensive.

Cite this paper

APA 7

(2008). Assessing the Complexity of Plan Recognition.

MLA 9

“Assessing the Complexity of Plan Recognition.” 2008.

Chicago

2008. “Assessing the Complexity of Plan Recognition.”

Harvard

(2008) ‘Assessing the Complexity of Plan Recognition’.

BibTeX

@article{anon2008assessing,
  title = {{Assessing the Complexity of Plan Recognition}},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.