{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T13:57:26Z","timestamp":1768485446416,"version":"3.49.0"},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Complex Event Recognition (CER) systems detect event occurrences in streaming time-stamped input using predefined event patterns. Logic-based approaches are of special interest in CER, since, via Statistical Relational AI, they combine uncertainty-resilient reasoning with time and change, with machine learning, thus alleviating the cost of manual event pattern authoring. We present a system based on Answer Set Programming (ASP), capable of probabilistic reasoning with complex event patterns in the form of weighted rules in the Event Calculus, whose structure and weights are learnt online. We compare our ASP-based implementation with a Markov Logic-based one and with a number of state-of-the-art batch learning algorithms on CER data sets for activity recognition, maritime surveillance and fleet management. Our results demonstrate the superiority of our novel approach, both in terms of efficiency and predictive performance. This paper is under consideration for publication in Theory and Practice of Logic Programming (TPLP).<\/jats:p>","DOI":"10.1017\/s1471068421000107","type":"journal-article","created":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T22:43:02Z","timestamp":1627857782000},"page":"362-386","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":8,"title":["Online Learning Probabilistic Event Calculus Theories in Answer Set Programming"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8804-470X","authenticated-orcid":false,"given":"NIKOS","family":"KATZOURIS","sequence":"first","affiliation":[]},{"given":"GEORGIOS","family":"PALIOURAS","sequence":"additional","affiliation":[]},{"given":"ALEXANDER","family":"ARTIKIS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2021,8,1]]},"reference":[{"key":"S1471068421000107_ref17","first-page":"817","article-title":"Online learning of event definitions","volume":"5","author":"Katzouris","year":"2016","journal-title":"TPLP 16"},{"key":"S1471068421000107_ref26","volume-title":"Commonsense Reasoning: An Event Calculus Based Approach","author":"Mueller","year":"2014"},{"key":"S1471068421000107_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-019-05798-y"},{"key":"S1471068421000107_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10928-8_24"},{"key":"S1471068421000107_ref9","doi-asserted-by":"crossref","unstructured":"Domingos, P. M. and Hulten, G. 2000. Mining high-speed data streams. In ACM SIGKDD, 71\u201380.","DOI":"10.1145\/347090.347107"},{"key":"S1471068421000107_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2008.10.007"},{"key":"S1471068421000107_ref29","unstructured":"Skarlatidis, A. and Michelioudakis, E. 2014. Logical Markov Random Fields (LoMRF): An open-source implementation of Markov Logic Networks."},{"key":"S1471068421000107_ref14","unstructured":"Katzouris, N. 2017. Scalable relational learning for event recognition. PhD Thesis, University of Athens. http:\/\/users.iit.demokritos.gr\/nkatz\/papers\/nkatz-phd.pdf"},{"key":"S1471068421000107_ref23","unstructured":"Lee, J. and Wang, Y. 2016. Weighted rules under the stable model semantics. In KR, 2016."},{"key":"S1471068421000107_ref31","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841900022X"},{"key":"S1471068421000107_ref15","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2020\/81"},{"key":"S1471068421000107_ref4","doi-asserted-by":"crossref","unstructured":"Athakravi, D. , Corapi, D. , Broda, K. and Russo, A. 2013. Learning through hypothesis refinement using answer set programming. In Inductive Logic Programming. Springer, 31\u201346.","DOI":"10.1007\/978-3-662-44923-3_3"},{"key":"S1471068421000107_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.11.033"},{"key":"S1471068421000107_ref1","article-title":"Probabilistic complex event recognition: A survey","volume":"5","author":"Alevizos","year":"2017","journal-title":"ACM Computing Surveys 50"},{"key":"S1471068421000107_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11558-0_22"},{"key":"S1471068421000107_ref13","doi-asserted-by":"crossref","unstructured":"Huynh, T. N. and Mooney, R. J. 2011. Online max-margin weight learning for markov logic networks. In SDM. SIAM, 642\u2013651.","DOI":"10.1137\/1.9781611972818.55"},{"key":"S1471068421000107_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24658-7"},{"key":"S1471068421000107_ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2356476"},{"key":"S1471068421000107_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-016-0266-x"},{"key":"S1471068421000107_ref12","doi-asserted-by":"crossref","unstructured":"Huynh, T. N. and Mooney, R. J. 2009. Max-margin weight learning for markov logic networks. In ECML-2009. Springer, 564\u2013579.","DOI":"10.1007\/978-3-642-04180-8_54"},{"key":"S1471068421000107_ref8","first-page":"1","article-title":"Statistical relational artificial intelligence: Logic, probability, and computation","volume":"2","author":"De Raedt","year":"2016","journal-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning 10"},{"key":"S1471068421000107_ref5","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/10654.001.0001"},{"key":"S1471068421000107_ref22","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000400"},{"key":"S1471068421000107_ref10","unstructured":"Duchi, J. , Hazan, E. and Singer, Y. 2011. Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research 12, Jul, 2121\u20132159."},{"key":"S1471068421000107_ref30","first-page":"11","article-title":"Probabilistic event calculus for event recognition","volume":"2","author":"Skarlatidis","year":"2015","journal-title":"ACM Transactions on Computational Logic (TOCL) 16"},{"key":"S1471068421000107_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68856-3"},{"key":"S1471068421000107_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5512-1"},{"key":"S1471068421000107_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888912000264"},{"key":"S1471068421000107_ref21","unstructured":"Law, M. , Russo, A. and Broda, K. 2018. Inductive learning of answer set programs from noisy examples. Advances in Cognitive Systems."},{"key":"S1471068421000107_ref6","first-page":"15","article-title":"Processing flows of information: From data stream to complex event processing","volume":"3","author":"Cugola","year":"2012","journal-title":"ACM Computing Surveys (CSUR) 44"},{"key":"S1471068421000107_ref25","doi-asserted-by":"crossref","unstructured":"Michelioudakis, E. , Skarlatidis, A. , Paliouras, G. and Artikis, A. 2016. Osla: Online structure learning using background knowledge axiomatization. In ECML. Springer, 232\u2013247.","DOI":"10.1007\/978-3-319-46128-1_15"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068421000107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T23:38:22Z","timestamp":1680478702000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068421000107\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,1]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["S1471068421000107"],"URL":"https:\/\/doi.org\/10.1017\/s1471068421000107","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,1]]},"assertion":[{"value":"\u00a9 The Author(s), 2021. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}