The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A probabilistic plan recognition algorithm based on plan tree grammars
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Circumscription—A form of non-monotonic reasoning
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90011-9 · Cited by 2,017
Policy Recognition in the Abstract Hidden Markov Model
Bui, H. H., Venkatesh, S., & West, G. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.839 · Cited by 123
Cited by
A survey of real-time strategy game AI research and competition in StarCraft
Ontanon, S., Synnaeve, G., Uriarte, A., Richoux, F., Churchill, D., & Preuss, M. (2013) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2013.2286295 · Cited by 423
Autonomous agents modelling other agents: A comprehensive survey and open problems
Albrecht, S. V., & Stone, P. (2018) · Artificial Intelligence · doi:10.1016/j.artint.2018.01.002 · Cited by 417
“Lesh and Etzioni (1995) and Hong (2001, 2000) (Blaylock and Allen, 2004, 2003) yes no – ∗ yes no – ∗∗ discrete full (Fagan and Cunningham, 2003) no yes yes yes no – ∗∗ discrete full (Kerkez and Cox, 2003) no yes yes yes no – ∗∗ discrete full (Bui et al., 2002) yes no yes yes no – ∗∗ discrete partial (Hong, 2001, 2000)…”
BackgroundMethodInfluentialDeliberation for autonomous robots: A survey
Ingrand, F., & Ghallab, M. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.003 · Cited by 309
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Ramírez, M., & Geffner, H. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7745 · Cited by 274
Metadata
- Authors
- Geib, C. W., & Goldman, R. P.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2009-07
- Volume
- 173
- Issue
- 11
- Pages
- 1101-1132
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W1981637451
- Cited by
- 206
- References
- 2
- FWCI
- 15.18
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A probabilistic plan recognition algorithm based on plan tree grammars. https://app.cochat.ai/papers/10.1016/j.artint.2009.01.003
- The paper
- Geib, C. W., & Goldman, R. P. (2009). A probabilistic plan recognition algorithm based on plan tree grammars. Artificial Intelligence. https://doi.org/10.1016/j.artint.2009.01.003
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.