|
Informatics Report Series
|
|
|
|
|
|
|
|
|
| Title:Assessing the Complexity of Plan Recognition |
| Authors:
Christopher Geib
|
| Date: 2004 |
| Publication Title:Proceedings of the Conference of the American Association of Artificial Intelligence (AAAI-2004) |
|
Publication Type:Conference Paper
Publication Status:Published
|
|
Page Nos:507-512
|
|
|
- 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.
- Links To Paper
- 1st Link
- Bibtex format
- @InProceedings{EDI-INF-RR-0964,
- author = {
Christopher Geib
},
- title = {Assessing the Complexity of Plan Recognition},
- book title = {Proceedings of the Conference of the American Association of Artificial Intelligence (AAAI-2004)},
- year = 2004,
- pages = {507-512},
- url = {http://homepages.inf.ed.ac.uk/cgeib/AAAI04GeibC.pdf},
- }
|
