{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:30:34Z","timestamp":1742913034715,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031556296"},{"type":"electronic","value":"9783031556302"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-55630-2_5","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:51:26Z","timestamp":1710831086000},"page":"52-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Automata-Based Complex Event Patterns in\u00a0Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Katzouris","sequence":"first","affiliation":[]},{"given":"Georgios","family":"Paliouras","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, J., Diao, Y., Gyllstrom, D., Immerman, N.: Efficient pattern matching over event streams. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 147\u2013160 (2008)","DOI":"10.1145\/1376616.1376634"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00778-021-00698-x","volume":"31","author":"E Alevizos","year":"2022","unstructured":"Alevizos, E., Artikis, A., Paliouras, G.: Complex event forecasting with prediction suffix trees. VLDB J. 31(1), 157\u2013180 (2022)","journal-title":"VLDB J."},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3117809","volume":"50","author":"E Alevizos","year":"2017","unstructured":"Alevizos, E., Skarlatidis, A., Artikis, A., Paliouras, G.: Probabilistic complex event recognition: a survey. ACM Comput. Surv. (CSUR) 50(5), 1\u201331 (2017)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"5_CR5","unstructured":"Angluin, D., Eisenstat, S., Fisman, D.: Learning regular languages via alternating automata. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-96145-3_23","volume-title":"Computer Aided Verification","author":"G Argyros","year":"2018","unstructured":"Argyros, G., D\u2019Antoni, L.: The learnability of symbolic automata. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 427\u2013445. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_23"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Cugola, G., Margara, A.: Tesla: a formally defined event specification language. In: Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems, pp. 50\u201361 (2010)","DOI":"10.1145\/1827418.1827427"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2187671.2187677","volume":"44","author":"G Cugola","year":"2012","unstructured":"Cugola, G., Margara, A.: Processing flows of information: from data stream to complex event processing. ACM Comput. Surv. (CSUR) 44(3), 15 (2012)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-63387-9_3","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2017","unstructured":"D\u2019Antoni, L., Veanes, M.: The power of symbolic automata and transducers. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 47\u201367. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_3"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Demers, A., Gehrke, J., Hong, M., Riedewald, M., White, W.: Towards expressive publish\/subscribe systems. In: International Conference on Extending Database Technology, pp. 627\u2013644. Springer (2006)","DOI":"10.1007\/11687238_38"},{"key":"5_CR11","unstructured":"Demers, A.J., Gehrke, J., Panda, B., Riedewald, M., Sharma, V., White, W.M., et al.: Cayuga: a general purpose event monitoring system. In: Cidr, vol. 7, pp. 412\u2013422 (2007)"},{"key":"5_CR12","unstructured":"Diao, Y., Immerman, N., Gyllstrom, D.: Sase+: an agile language for kleene closure over event streams. UMass Technical Report (2007)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Drews, S., D\u2019Antoni, L.: Learning symbolic automata. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 173\u2013189. Springer (2017)","DOI":"10.1007\/978-3-662-54577-5_10"},{"key":"5_CR14","unstructured":"Fisman, D., Frenkel, H., Zilles, S.: Inferring symbolic automata (2021). arXiv preprint arXiv:2112.14252"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1613\/jair.1.12372","volume":"70","author":"D Furelos-Blanco","year":"2021","unstructured":"Furelos-Blanco, D., Law, M., Jonsson, A., Broda, K., Russo, A.: Induction and exploitation of subgoal automata for reinforcement learning. J. Artif. Intell. Res. 70, 1031\u20131116 (2021)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-019-00544-0","volume":"23","author":"G Giantamidis","year":"2021","unstructured":"Giantamidis, G., Tripakis, S., Basagiannis, S.: Learning moore machines from input-output traces. Int. J. Softw. Tools Technol. Transfer 23(1), 1\u201329 (2021)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00778-019-00557-w","volume":"29","author":"N Giatrakos","year":"2020","unstructured":"Giatrakos, N., Alevizos, E., Artikis, A., Deligiannakis, A., Garofalakis, M.N.: Complex event recognition in the big data era: a survey. VLDB J. 29(1), 313\u2013352 (2020)","journal-title":"VLDB J."},{"issue":"5","key":"5_CR18","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967)","journal-title":"Inf. Control"},{"key":"5_CR19","unstructured":"Grez, A., Riveros, C., Ugarte, M.: A formal framework for complex event processing. In: 22nd International Conference on Database Theory (ICDT 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"De la Higuera, C.: Grammatical inference: learning automata and grammars. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139194655"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingo one dfa learning competition and a new evidence-driven state merging algorithm. In: International Colloquium on Grammatical Inference. pp. 1\u201312. Springer (1998)","DOI":"10.1007\/BFb0054059"},{"issue":"7","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1093\/bioinformatics\/bty766","volume":"35","author":"G Letort","year":"2019","unstructured":"Letort, G., Montagud, A., Stoll, G., Heiland, R., Barillot, E., Macklin, P., Zinovyev, A., Calzone, L.: Physiboss: a multi-scale agent-based modelling framework integrating physical dimension and cell signalling. Bioinformatics 35(7), 1188\u20131196 (2019)","journal-title":"Bioinformatics"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Answer set programming. Springer (2019)","DOI":"10.1007\/978-3-030-24658-7"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Lin, J., Keogh, E., Lonardi, S., Chiu, B.: A symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 2\u201311 (2003)","DOI":"10.1145\/882082.882086"},{"issue":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10618-007-0064-z","volume":"15","author":"J Lin","year":"2007","unstructured":"Lin, J., Keogh, E., Wei, L., Lonardi, S.: Experiencing sax: a novel symbolic representation of time series. Data Min. Knowl. Disc. 15(2), 107\u2013144 (2007)","journal-title":"Data Min. Knowl. Disc."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-63121-9_8","volume-title":"Models, Algorithms, Logics and Tools","author":"O Maler","year":"2017","unstructured":"Maler, O., Mens, I.-E.: A generic algorithm for learning symbolic automata from membership queries. In: Aceto, L., Bacci, G., Bacci, G., Ing\u00f3lfsd\u00f3ttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools. LNCS, vol. 10460, pp. 146\u2013169. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63121-9_8"},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10994-013-5358-3","volume":"94","author":"SH Muggleton","year":"2014","unstructured":"Muggleton, S.H., Lin, D., Pahlavi, N., Tamaddoni-Nezhad, A.: Meta-interpretive learning: application to grammatical inference. Mach. Learn. 94(1), 25\u201349 (2014)","journal-title":"Mach. Learn."},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Identifying regular languages in polynomial time. In: Advances in Structural and Syntactic Pattern Recognition, pp. 99\u2013108. World Scientific (1992)","DOI":"10.1142\/9789812797919_0007"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-44892-6_4","volume-title":"Middleware 2003","author":"PR Pietzuch","year":"2003","unstructured":"Pietzuch, P.R., Shand, B., Bacon, J.: A framework for event composition in distributed systems. In: Endler, M., Schmidt, D. (eds.) Middleware 2003. LNCS, vol. 2672, pp. 62\u201382. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44892-6_4"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Schultz-M\u00f8ller, N.P., Migliavacca, M., Pietzuch, P.: Distributed complex event processing with query rewriting. In: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems, pp. 1\u201312 (2009)","DOI":"10.1145\/1619258.1619264"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Shvo, M., Li, A.C., Icarte, R.T., McIlraith, S.A.: Interpretable sequence classification via discrete optimization. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), pp. 9647\u20139656 (2021)","DOI":"10.1609\/aaai.v35i11.17161"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-319-77313-1_14","volume-title":"Language and Automata Theory and Applications","author":"R Smetsers","year":"2018","unstructured":"Smetsers, R., Fiter\u0103u-Bro\u015ftean, P., Vaandrager, F.: Model learning as a satisfiability modulo theories problem. In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 182\u2013194. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77313-1_14"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Ulyantsev, V., Zakirzyanov, I., Shalyto, A.: Bfs-based symmetry breaking predicates for dfa identification. In: International Conference on Language and Automata Theory and Applications. pp. 611\u2013622. Springer (2015)","DOI":"10.1007\/978-3-319-15579-1_48"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Wieczorek, W.: Grammatical Inference. Springer (2017)","DOI":"10.1007\/978-3-319-46801-3"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Wu, E., Diao, Y., Rizvi, S.: High-performance complex event processing over streams. In: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, pp. 407\u2013418 (2006)","DOI":"10.1145\/1142473.1142520"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, H., Diao, Y., Immerman, N.: On complexity and optimization of expensive queries in complex event processing. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 217\u2013228 (2014)","DOI":"10.1145\/2588555.2593671"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55630-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:52:34Z","timestamp":1710831154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55630-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556296","9783031556302"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55630-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Windsor Great Park","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijclr22.doc.ic.ac.uk\/ilp2022.html\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}