{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/probabilistic-event-calculus-for-event","title":"Probabilistic Event Calculus for Event Recognition","arxiv_id":"1207.3270","date":"2012-07-13","proceeding":null,"authors":["Anastasios Skarlatidis","Georgios Paliouras","Alexander Artikis","George A. Vouros"],"abstract":"Symbolic event recognition systems have been successfully applied to a\nvariety of application domains, extracting useful information in the form of\nevents, allowing experts or other systems to monitor and respond when\nsignificant events are recognised. In a typical event recognition application,\nhowever, these systems often have to deal with a significant amount of\nuncertainty. In this paper, we address the issue of uncertainty in logic-based\nevent recognition by extending the Event Calculus with probabilistic reasoning.\nMarkov Logic Networks are a natural candidate for our logic-based formalism.\nHowever, the temporal semantics of the Event Calculus introduce a number of\nchallenges for the proposed model. We show how and under what assumptions we\ncan overcome these problems. Additionally, we study how probabilistic modelling\nchanges the behaviour of the formalism, affecting its key property, the inertia\nof fluents. Furthermore, we demonstrate the advantages of the probabilistic\nEvent Calculus through examples and experiments in the domain of activity\nrecognition, using a publicly available dataset for video surveillance.","url_abs":"http://arxiv.org/abs/1207.3270v2","url_pdf":"http://arxiv.org/pdf/1207.3270v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"probabilistic-event-calculus-for-event","repo_url":"https://github.com/koo5/notes2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"activity-recognition","task_name":"Activity Recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"koo5/notes2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ecf9382912a6c73475b64697797150a51c052d201826917c9f6e51ad4cc30c0c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}