Sciweavers

Share
AIPS
2008

A New Probabilistic Plan Recognition Algorithm Based on String Rewriting

10 years 3 months ago
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yappr). Yappr is based on weighted model counting, building its models using string rewriting rather than tree adjunction or other tree building methods used in previous work. Since model construction is often the most computationally expensive part of such algorithms, this results in significant reductions in the algorithm's runtime.
Christopher W. Geib, John Maraist, Robert P. Goldm
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2008
Where AIPS
Authors Christopher W. Geib, John Maraist, Robert P. Goldman
Comments (0)
books