{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T21:48:23Z","timestamp":1780091303558,"version":"3.54.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031492983","type":"print"},{"value":"9783031492990","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49299-0_3","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:06:49Z","timestamp":1703135209000},"page":"30-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Towards ILP-Based $$\\text {LTL}_\\text {f}$$ Passive Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9644-7975","authenticated-orcid":false,"given":"Antonio","family":"Ielo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8934-9756","authenticated-orcid":false,"given":"Mark","family":"Law","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-1324","authenticated-orcid":false,"given":"Valeria","family":"Fionda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8218-3178","authenticated-orcid":false,"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9680-7658","authenticated-orcid":false,"given":"Giuseppe","family":"De Giacomo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3318-8711","authenticated-orcid":false,"given":"Alessandra","family":"Russo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00450-009-0057-9","volume":"23","author":"WMP van der Aalst","year":"2009","unstructured":"van der Aalst, W.M.P., Pesic, M., Schonenberg, H.: Declarative workflows: balancing between flexibility and support. Comput. Sci. Res. Dev. 23(2), 99\u2013113 (2009)","journal-title":"Comput. Sci. Res. Dev."},{"key":"3_CR2","unstructured":"Arif, M.F., Larraz, D., Echeverria, M., Reynolds, A., Chowdhury, O., Tinelli, C.: SYSLITE: syntax-guided synthesis of PLTL formulas from finite traces. In: FMCAD, pp. 93\u2013103 (2020)"},{"issue":"12","key":"3_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Camacho, A., McIlraith, S.A.: Learning interpretable models expressed in linear temporal logic. In: ICAPS, pp. 621\u2013630 (2019)","DOI":"10.1609\/icaps.v29i1.3529"},{"key":"3_CR5","series-title":"Surveys in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83952-8","volume-title":"Logic Programming and Databases","author":"S Ceri","year":"1990","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Surveys in Computer Science, Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/978-3-642-83952-8"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-00899-3_16","volume":"2","author":"F Chesani","year":"2009","unstructured":"Chesani, F., Lamma, E., Mello, P., Montali, M., Riguzzi, F., Storari, S.: Exploiting inductive logic programming techniques for declarative process mining. Trans. Petri Nets Other Model. Concurr. 2, 278\u2013295 (2009)","journal-title":"Trans. Petri Nets Other Model. Concurr."},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374\u2013425 (2001)","journal-title":"ACM Comput. Surv."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Dodaro, C., Fionda, V., Greco, G.: LTL on weighted finite traces: formal foundations and algorithms. In: IJCAI, pp. 2606\u20132612 (2022)","DOI":"10.24963\/ijcai.2022\/361"},{"issue":"1\u20132","key":"3_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(96)00179-X","volume":"189","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Leone, N.: Abduction from logic programs: semantics and complexity. Theor. Comput. Sci. 189(1\u20132), 129\u2013177 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR10","unstructured":"Fijalkow, N., Lagarde, G.: The complexity of learning linear temporal formulas from examples. In: ICGI, pp. 237\u2013250 (2021)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1613\/jair.1.11256","volume":"63","author":"V Fionda","year":"2018","unstructured":"Fionda, V., Greco, G.: LTL on finite and process traces: complexity results and a practical reasoner. J. Artif. Intell. Res. 63, 557\u2013623 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR12","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":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11334-022-00444-8","volume":"18","author":"J Gaglione","year":"2022","unstructured":"Gaglione, J., Neider, D., Roy, R., Topcu, U., Xu, Z.: Maxsat-based temporal logic inference from noisy data. Innov. Syst. Softw. Eng. 18(3), 427\u2013442 (2022)","journal-title":"Innov. Syst. Softw. Eng."},{"key":"3_CR14","series-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","volume-title":"Answer Set Solving in Practice","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, San Rafael (2012)"},{"issue":"3\/4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"New Gener. Comput."},{"issue":"5","key":"3_CR16","doi-asserted-by":"publisher","first-page":"2930","DOI":"10.1109\/LRA.2023.3263368","volume":"8","author":"E Ghiorzi","year":"2023","unstructured":"Ghiorzi, E., Colledanchise, M., Piquet, G., Bernagozzi, S., Tacchella, A., Natale, L.: Learning linear temporal properties for autonomous robotic systems. IEEE Rob. Autom. Lett. 8(5), 2930\u20132937 (2023)","journal-title":"IEEE Rob. Autom. Lett."},{"key":"3_CR17","unstructured":"Giacomo, G.D., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI, pp. 854\u2013860. IJCAI\/AAAI (2013)"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S1471068421000508","volume":"23","author":"R Kaminski","year":"2023","unstructured":"Kaminski, R., Romero, J., Schaub, T., Wanko, P.: How to build your own asp-based system?! Theory Pract. Log. Program. 23(1), 299\u2013361 (2023)","journal-title":"Theory Pract. Log. Program."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.eswa.2017.06.013","volume":"87","author":"M Kazmi","year":"2017","unstructured":"Kazmi, M., Sch\u00fcller, P., Sayg\u0131n, Y.: Improving scalability of inductive logic programming via pruning and best-effort optimisation. Expert Syst. Appl. 87, 291\u2013303 (2017)","journal-title":"Expert Syst. Appl."},{"key":"3_CR20","unstructured":"Kolter, R.: Inductive temporal logic programming. Ph.D. thesis, University of Kaiserslautern (2009)"},{"key":"3_CR21","unstructured":"Law, M., Russo, A., Broda, K.: The ILASP system for learning answer set programs (2015). https:\/\/www.ilasp.com\/"},{"key":"3_CR22","unstructured":"Law, M., Russo, A., Broda, K.: Simplified reduct for choice rules in ASP. Technical report, Department of Computing (DTR2015-2), Imperial College London (2015)"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.artint.2018.03.005","volume":"259","author":"M Law","year":"2018","unstructured":"Law, M., Russo, A., Broda, K.: The complexity and generality of learning answer set programs. Artif. Intell. 259, 110\u2013146 (2018)","journal-title":"Artif. Intell."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Law, M., Russo, A., Broda, K.: Logic-based learning of answer set programs. In: Reasoning Web, pp. 196\u2013231 (2019)","DOI":"10.1007\/978-3-030-31423-1_6"},{"key":"3_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103369","volume":"289","author":"J Li","year":"2020","unstructured":"Li, J., Pu, G., Zhang, Y., Vardi, M.Y., Rozier, K.Y.: Sat-based explicit LTLF satisfiability checking. Artif. Intell. 289, 103369 (2020)","journal-title":"Artif. Intell."},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Mazzotta, G., Ricca, F., Dodaro, C.: Compilation of aggregates in ASP systems. In: AAAI, pp. 5834\u20135841. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i5.20527"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Mrowca, A., Nocker, M., Steinhorst, S., G\u00fcnnemann, S.: Learning temporal specifications from imperfect traces using bayesian inference. In: DAC, p. 96. ACM (2019)","DOI":"10.1145\/3316781.3317847"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Neider, D., Gavran, I.: Learning linear temporal properties. In: FMCAD, pp. 1\u201310 (2018)","DOI":"10.23919\/FMCAD.2018.8603016"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-99524-9_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Raha","year":"2022","unstructured":"Raha, R., Roy, R., Fijalkow, N., Neider, D.: Scalable anytime algorithms for learning fragments of linear temporal logic. In: TACAS 2022. LNCS, vol. 13243, pp. 263\u2013280. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_14"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Reynolds, A., Barbosa, H., N\u00f6tzli, A., Barrett, C.W., Tinelli, C.: cvc4sy: smart and fast term enumeration for syntax-guided synthesis. In: CAV, pp. 74\u201383 (2019)","DOI":"10.1007\/978-3-030-25543-5_5"},{"key":"3_CR32","unstructured":"Ribeiro, T., Folschette, M., Magnin, M., Okazaki, K., Kuo-Yen, L., Inoue, K.: Diagnosis of event sequences with LFIT. In: The 31st International Conference on Inductive Logic Programming (ILP) (2022)"},{"key":"3_CR33","unstructured":"Tange, O.: GNU parallel: the command-line power tool. Login Usenix Mag. 36(1) (2011)"}],"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-49299-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:07:35Z","timestamp":1703135255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49299-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492983","9783031492990"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49299-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","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":"Bari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ilp2023.unife.it\/","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":"https:\/\/easychair.org\/","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","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":"1","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":"61% - 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":"2.89","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.55","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)"}},{"value":"1 late-breaking abstract only for oral presentation (not to be included in the conference proceedings)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}