Anastasios Skarlatidis1,2, Georgios Paliouras1, George A. Vouros2, Alexander Artikis1
1Institute of Informatics and Telecommunications, NCSR “Demokritos” 2Department of Digital Systems, University of Piraeus
Abstract
In this paper, we address the issue of uncertainty in event recognition by extending the Event Calculus with probabilistic reasoning. Markov Logic Networks are a natural candidate for our logic-based formalism. However, the temporal semantics of Event Calculus introduce a number of challenges for the proposed model. We show how and under what assumptions we can overcome these problems. Additionally, we demonstrate the advantages of the probabilistic Event Calculus through examples and experiments in the domain of activity recognition, using a publicly available dataset of video surveillance.
Downloads
The knowledge base source files of a probabilistic event recognition method that employs an Event Calculus formalism based on Markov Logic Networks, are given below:
- Markov Logic Networks knowledge base files, that include the Discrete Event Calculus domain-independent axioms and the high-level event definitions for the CAVIAR dataset, are available here
- The dataset source files of the CAVIAR project are given below:
- The source code of the scripts that transform the original XML-based CAVIAR dataset into Markov Logic Networks and Prolog formats, are available here
BibTex
@inproceedings{PEC-MLN-RML11,
author = {Anastasios Skarlatidis and Georgios Paliouras and George A. Vouros and Alexander Artikis},
title = {Probabilistic Event Calculus Based on Markov Logic Networks},
booktitle = {RuleML America},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {7018},
year = {2011},
pages = {155-170},
ee = {http://dx.doi.org/10.1007/978-3-642-24908-2_19}
}