{"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/incremental-learning-of-event-definitions","title":"Incremental Learning of Event Definitions with Inductive Logic Programming","arxiv_id":"1402.5988","date":"2014-02-24","proceeding":null,"authors":["Nikos Katzouris","Alexander Artikis","George Paliouras"],"abstract":"Event recognition systems rely on properly engineered knowledge bases of\nevent definitions to infer occurrences of events in time. The manual\ndevelopment of such knowledge is a tedious and error-prone task, thus\nevent-based applications may benefit from automated knowledge construction\ntechniques, such as Inductive Logic Programming (ILP), which combines machine\nlearning with the declarative and formal semantics of First-Order Logic.\nHowever, learning temporal logical formalisms, which are typically utilized by\nlogic-based Event Recognition systems is a challenging task, which most ILP\nsystems cannot fully undertake. In addition, event-based data is usually\nmassive and collected at different times and under various circumstances.\nIdeally, systems that learn from temporal data should be able to operate in an\nincremental mode, that is, revise prior constructed knowledge in the face of\nnew evidence. Most ILP systems are batch learners, in the sense that in order\nto account for new evidence they have no alternative but to forget past\nknowledge and learn from scratch. Given the increased inherent complexity of\nILP and the volumes of real-life temporal data, this results to algorithms that\nscale poorly. In this work we present an incremental method for learning and\nrevising event-based knowledge, in the form of Event Calculus programs. The\nproposed algorithm relies on abductive-inductive learning and comprises a\nscalable clause refinement methodology, based on a compressive summarization of\nclause coverage in a stream of examples. We present an empirical evaluation of\nour approach on real and synthetic data from activity recognition and city\ntransport applications.","url_abs":"http://arxiv.org/abs/1402.5988v2","url_pdf":"http://arxiv.org/pdf/1402.5988v2.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":"incremental-learning-of-event-definitions","repo_url":"https://github.com/nkatzz/iled","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"activity-recognition","task_name":"Activity Recognition"},{"task_slug":"incremental-learning","task_name":"Incremental Learning"},{"task_slug":"inductive-learning","task_name":"Inductive Learning"},{"task_slug":"inductive-logic-programming","task_name":"Inductive logic programming"}],"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":"nkatzz/iled","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":"1bcbbf4f5505e9585667d726c3b639e6007e809a1ec96ff027b81769c795573f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}