{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T05:42:51Z","timestamp":1769578971957,"version":"3.49.0"},"reference-count":40,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Inferring linear temporal logic over finite traces ($\\text{LTL}_{\\text{f}}$) formulas from a set of example traces, known as passive learning, presents significant challenges due to its combinatorial nature. In this paper, we introduce a novel approach to $\\text{LTL}_{\\text{f}}$ passive learning based on inductive logic programming (ILP), leveraging the inductive learning of answer set programs framework. Our ILP-based method effectively exploits the set of example traces to guide the learning process, and experimental results demonstrate that it o ffers a more efficient solution compared to traditional techniques based on propositional satisfiability.<\/jats:p>","DOI":"10.1093\/logcom\/exaf069","type":"journal-article","created":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T12:58:03Z","timestamp":1762606683000},"source":"Crossref","is-referenced-by-count":0,"title":["Towards ILP-based LTLf passive learning"],"prefix":"10.1093","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9644-7975","authenticated-orcid":false,"given":"Antonio","family":"Ielo","sequence":"first","affiliation":[{"name":"University of Calabria, Department of Mathematics and Computer Science , Rende, 87036 ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8934-9756","authenticated-orcid":false,"given":"Mark","family":"Law","sequence":"additional","affiliation":[{"name":"ILASP Limited, Grantham , NG31 7EU ,","place":["United Kingdom"]},{"name":"Imperial College London, Department of Computing , London, SW7 2AZ ,","place":["United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-1324","authenticated-orcid":false,"given":"Valeria","family":"Fionda","sequence":"additional","affiliation":[{"name":"University of Calabria, Department of Mathematics and Computer Science , Rende, 87036 ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8218-3178","authenticated-orcid":false,"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[{"name":"University of Calabria, Department of Mathematics and Computer Science , Rende, 87036 ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9680-7658","authenticated-orcid":false,"given":"Giuseppe","family":"De Giacomo","sequence":"additional","affiliation":[{"name":"University of Oxford, Department of Computer Science , Oxford, OX1 3QD ,","place":["United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3318-8711","authenticated-orcid":false,"given":"Alessandra","family":"Russo","sequence":"additional","affiliation":[{"name":"Imperial College London, Department of Computing , London, SW7 2AZ ,","place":["United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2026,1,26]]},"reference":[{"key":"2026012711401817500_ref1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00450-009-0057-9","article-title":"Declarative workflows: Balancing between flexibility and support","volume":"23","author":"van der Aalst","year":"2009","journal-title":"Computer Science - Research and Development"},{"key":"2026012711401817500_ref2","article-title":"Syslite github repository traces","author":"Arif"},{"key":"2026012711401817500_ref3","first-page":"93","volume-title":"SYSLITE: Syntax-Guided Synthesis of PLTL Formulas from Finite Traces","author":"Arif","year":"2020"},{"key":"2026012711401817500_ref4","doi-asserted-by":"publisher","first-page":"104957","DOI":"10.1016\/j.ic.2022.104957","article-title":"Survey on mining signal temporal logic specifications","volume":"289","author":"Bartocci","year":"2022","journal-title":"Information and Computation"},{"key":"2026012711401817500_ref5","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.4230\/LIPIcs.STACS.2025.19","volume-title":"42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs)","author":"Bordais","year":"2025"},{"key":"2026012711401817500_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-71162-6_16","volume-title":"Formal Methods. FM 2024","author":"Bordais","year":"2025"},{"key":"2026012711401817500_ref7","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","article-title":"Answer set programming at a glance","volume":"54","author":"Brewka","year":"2011","journal-title":"Communications of the ACM"},{"key":"2026012711401817500_ref8","first-page":"621","volume-title":"Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS 2019,Berkeley, CA, USA, July 11-15, 2019","author":"Camacho","year":"2019"},{"key":"2026012711401817500_ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83952-8","volume-title":"Logic Programming and Databases. Surveys in Computer Science","author":"Ceri","year":"1990"},{"key":"2026012711401817500_ref10","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-642-00899-3_16","article-title":"Exploiting inductive logic programming techniques for declarative process mining","volume":"2","author":"Chesani","year":"2009","journal-title":"Transactions on Petri Nets and Other Models of Concurrency"},{"key":"2026012711401817500_ref11","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1613\/jair.1.13507","article-title":"Inductive logic programming at 30: A new introduction","volume":"74","author":"Cropper","year":"2022","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2026012711401817500_ref12","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/502807.502810","article-title":"Complexity and expressive power of logic programming","volume":"33","author":"Dantsin","year":"2001","journal-title":"ACM Computing Surveys"},{"key":"2026012711401817500_ref13","doi-asserted-by":"publisher","first-page":"2606","DOI":"10.24963\/ijcai.2022\/361","volume-title":"Pro-ceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022","author":"Dodaro","year":"2022"},{"key":"2026012711401817500_ref14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0304-3975(96)00179-X","article-title":"Abduction from logic programs: Semantics and complexity","volume":"189","author":"Eiter","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"2026012711401817500_ref15","first-page":"237","volume-title":"The Complexity of Learning Linear Temporal Formulas from Examples","author":"Fijalkow","year":"2021"},{"key":"2026012711401817500_ref16","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1613\/jair.1.11256","article-title":"LTL on finite and process traces: Complexity results and a practical reasoner","volume":"63","author":"Fionda","year":"2018","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2026012711401817500_ref17","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1613\/jair.1.12372","article-title":"Induction and exploitation of subgoal automata for reinforcement learning","volume":"70","author":"Furelos-Blanco","year":"2021","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2026012711401817500_ref18","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s11334-022-00444-8","article-title":"Maxsat-based temporal logic inference from noisy data","volume":"18","author":"Gaglione","year":"2022","journal-title":"Innovations in Systems and Software Engineering"},{"key":"2026012711401817500_ref19","volume-title":"Answer Set Solving in Practice","author":"Gebser","year":"2012"},{"key":"2026012711401817500_ref20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"key":"2026012711401817500_ref21","doi-asserted-by":"crossref","first-page":"2930","DOI":"10.1109\/LRA.2023.3263368","article-title":"Learning linear temporal properties for autonomous robotic systems","volume":"8","author":"Ghiorzi","year":"2023","journal-title":"IEEE Robotics and Automation Letters"},{"key":"2026012711401817500_ref22","first-page":"854","volume-title":"IJCAI 2013, Proceedingsof the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013","author":"De Giacomo","year":"2013"},{"key":"2026012711401817500_ref23","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S1471068421000508","article-title":"How to build your own asp-based system?!","volume":"23","author":"Kaminski","year":"2023","journal-title":"Theory and Practice of Logic Programming"},{"key":"2026012711401817500_ref24","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.eswa.2017.06.013","article-title":"Improving scalability of inductive logic programming via pruning and best-effort optimisation","volume":"87","author":"Kazmi","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"2026012711401817500_ref25","article-title":"The ILASP system for learning answer set programs","author":"Law","year":"2015"},{"key":"2026012711401817500_ref26","article-title":"Simplified reduct for choice rules in ASP","volume-title":"Tech. Rep., Department of Computing (DTR2015\u20132)","author":"Law","year":"2015"},{"key":"2026012711401817500_ref27","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.artint.2018.03.005","article-title":"The complexity and generality of learning answer set programs","volume":"259","author":"Law","year":"2018","journal-title":"Artificial Intelligence"},{"key":"2026012711401817500_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31423-1_6","volume-title":"Reasoning Web. Explainable Artificial Intelligence","author":"Law","year":"2019"},{"key":"2026012711401817500_ref29","doi-asserted-by":"crossref","first-page":"103369","DOI":"10.1016\/j.artint.2020.103369","article-title":"Sat-based explicit ltlf satisfiability checking","volume":"289","author":"Li","year":"2020","journal-title":"Artificial Intelligence"},{"key":"2026012711401817500_ref30","volume-title":"Learning Temporal Formulas from Examples Is Hard","author":"Mascle","year":"2023"},{"key":"2026012711401817500_ref31","first-page":"5834","volume-title":"Compilation of Aggregates in ASP Systems","author":"Mazzotta","year":"2022"},{"key":"2026012711401817500_ref32","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/3316781.3317847","volume-title":"Proceedings of the 56th Annual Design Automation Conference 2019, DAC 2019, Las Vegas, NV, USA, June 02-06, 2019","author":"Mrowca","year":"2019"},{"key":"2026012711401817500_ref33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.23919\/FMCAD.2018.8603016","volume-title":"2018 Formal Methods in Computer Aided Design, FMCAD 2018, Austin, TX, USA, October 30- November 2, 2018","author":"Neider","year":"2018"},{"key":"2026012711401817500_ref34","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/SFCS.1977.32","volume-title":"18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October -1 November 1977","author":"Pnueli","year":"1977"},{"key":"2026012711401817500_ref35","first-page":"263","article-title":"Scalable anytime algorithms for learning fragments of linear temporal logic","volume":"13243","author":"Raha","year":"2022.","journal-title":"In: TACAS. Lecture Notes in Computer Science"},{"key":"2026012711401817500_ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25543-5_5","volume-title":"Computer Aided Verification. CAV 2019","author":"Reynolds","year":"2019"},{"key":"2026012711401817500_ref37","doi-asserted-by":"publisher","first-page":"6507","DOI":"10.1609\/aaai.v37i5.25800","article-title":"Learning interpretable temporal properties from positive examples only","volume":"37","author":"Roy","year":"2023","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"2026012711401817500_ref38","volume-title":"Special NKS 2006 Wolfram Science Conference (pp. 1-12)","author":"Szudzik","year":"2006"},{"key":"2026012711401817500_ref39","unstructured":"Tange O. \u00a0GNU Parallel 2018, March 2018, 2018. 10.5281\/zenodo.1146014."},{"key":"2026012711401817500_ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-65633-0_10","volume-title":"Computer Aided Verification. CAV 2024","author":"Valizadeh","year":"2024"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/36\/2\/exaf069\/66591271\/exaf069.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/36\/2\/exaf069\/66591271\/exaf069.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T16:40:27Z","timestamp":1769532027000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/doi\/10.1093\/logcom\/exaf069\/8442311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,26]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,1,26]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exaf069","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,3]]},"published":{"date-parts":[[2026,1,26]]},"article-number":"exaf069"}}