Plan recognition is a form of abductive reasoning that involves inferring plans that best explain sets of observed actions. Most existing approaches to plan recognition and other abductive tasks employ either purely logical methods that do not handle uncertainty, or purely probabilistic methods that do not handle structured representations. To overcome these limitations, this paper introduces an approach to abductive reasoning using a first-order probabilistic logic, specifically Markov Logic Networks (MLNs). It introduces several novel techniques for making MLNs efficient and effective for abduction. Experiments on three plan recognition datasets show the benefit of our approach over existing methods.

PDF

Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI-2011) (2011), pp. 1069-1075.

@article{singla:aaai11, title={Abductive Markov Logic for Plan Recognition}, author={Parag Singla and Raymond J. Mooney}, booktitle={Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI-2011)}, month={August}, pages={1069-1075}, url="http://www.cs.utexas.edu/users/ai-lab?singla:aaai11", year={2011} }

Slides (PPT)