{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:43:56Z","timestamp":1742960636097,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"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_9","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:51:26Z","timestamp":1710831086000},"page":"117-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Diagnosis of\u00a0Event Sequences with\u00a0LFIT"],"prefix":"10.1007","author":[{"given":"Tony","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Maxime","family":"Folschette","sequence":"additional","affiliation":[]},{"given":"Morgan","family":"Magnin","sequence":"additional","affiliation":[]},{"given":"Kotaro","family":"Okazaki","sequence":"additional","affiliation":[]},{"given":"Lo","family":"Kuo-Yen","sequence":"additional","affiliation":[]},{"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., De Masellis, R., Montali, M.: Reasoning on LTL on finite traces: insensitivity to infiniteness. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 28 (2014)","DOI":"10.1609\/aaai.v28i1.8872"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10994-013-5353-8","volume":"94","author":"K Inoue","year":"2014","unstructured":"Inoue, K., Ribeiro, T., Sakama, C.: Learning from interpretation transition. Mach. Learn. 94(1), 51\u201379 (2014)","journal-title":"Mach. Learn."},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10994-015-5512-1","volume":"100","author":"N Katzouris","year":"2015","unstructured":"Katzouris, N., Artikis, A., Paliouras, G.: Incremental learning of event definitions with inductive logic programming. Mach. Learn. 100(2), 555\u2013585 (2015)","journal-title":"Mach. Learn."},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/181668.181671","volume":"5","author":"S Muggleton","year":"1994","unstructured":"Muggleton, S.: Inductive logic programming: derivations, successes and shortcomings. ACM SIGART Bull. 5(1), 5\u201311 (1994)","journal-title":"ACM SIGART Bull."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1109\/TASE.2020.3045565","volume":"19","author":"Y Pencol\u00e9","year":"2021","unstructured":"Pencol\u00e9, Y., Subias, A.: Diagnosability of event patterns in safe labeled time petri nets: a model-checking approach. IEEE Trans. Autom. Sci. Eng. 19, 1151\u20131162 (2021)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"9_CR6","unstructured":"Petri, C.A.: Kommunikation mit Automaten. Ph.D. thesis, Fakult\u00e4t f\u00fcr Mathematik und Physik, Technische Hochschule Darmstadt, Darmstadt (Allemagne) (1962)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, SFCS 1977, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"3593","DOI":"10.1007\/s10994-021-06105-4","volume":"111","author":"T Ribeiro","year":"2021","unstructured":"Ribeiro, T., Folschette, M., Magnin, M., Inoue, K.: Learning any memory-less discrete semantics for dynamical systems represented by logic programs. Mach. Learn. 111, 3593\u20133670 (2021)","journal-title":"Mach. Learn."},{"key":"9_CR9","unstructured":"Ribeiro, T., Folschette, M., Magnin, M., Inoue, K.: Polynomial algorithm for learning from interpretation transition. In: 1st International Joint Conference on Learning & Reasoning, pp. 1\u20135 (2021)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Sato, S., Watanabe, Y., Seki, H., Ishii, Y., Yuen, S.: Fault diagnosis for distributed cooperative system using inductive logic programming. In: 2020 IEEE International Conference on Prognostics and Health Management (ICPHM), pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/ICPHM49022.2020.9187032"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:52:39Z","timestamp":1710831159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55630-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556296","9783031556302"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55630-2_9","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)"}}]}}