{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:46:56Z","timestamp":1743108416903,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492983"},{"type":"electronic","value":"9783031492990"}],"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_7","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:06:49Z","timestamp":1703135209000},"page":"93-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["What Do Counterfactuals Say About the\u00a0World? Reconstructing Probabilistic Logic Programs from\u00a0Answers to\u00a0\u201cWhat If?\u201d Queries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7891-6030","authenticated-orcid":false,"given":"Kilian","family":"R\u00fcckschlo\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3895-8279","authenticated-orcid":false,"given":"Felix","family":"Weitk\u00e4mper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Bergadano, F., Gunetti, D.: Inductive Logic Programming: From Machine Learning to Software Engineering. MIT Press, Cambridge (1995). https:\/\/doi.org\/10.7551\/mitpress\/3731.001.0001","DOI":"10.7551\/mitpress\/3731.001.0001"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Bochman, A.: A Logical Theory of Causality. The MIT Press, Cambridge (2021). https:\/\/doi.org\/10.7551\/mitpress\/12387.001.0001","DOI":"10.7551\/mitpress\/12387.001.0001"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: a probabilistic Prolog and its application in link discovery. In: 20th International Joint Conference on Artificial Intelligence, vol. 7, pp. 2462\u20132467. AAAI Press, Hyderabad, India (2007). https:\/\/doi.org\/10.5555\/1625275.1625673","DOI":"10.5555\/1625275.1625673"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Hoeck, N.V.: Cognitive neuroscience of human counterfactual reasoning. Front. Hum. Neurosci. 9 (2015). https:\/\/doi.org\/10.3389\/fnhum.2015.00420","DOI":"10.3389\/fnhum.2015.00420"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Kiesel, R., R\u00fcckschlo\u00df, K., Weitk\u00e4mper, F.: \u201cWhat if?\u201d In probabilistic logic programming. Theory Pract. Logic Program. 1\u201316 (2023). https:\/\/doi.org\/10.1017\/S1471068423000133","DOI":"10.1017\/S1471068423000133"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Pearl, J.: Causality, 2 edn. Cambridge University Press, Cambridge (2000). https:\/\/doi.org\/10.1017\/CBO9780511803161","DOI":"10.1017\/CBO9780511803161"},{"key":"7_CR7","unstructured":"R\u00fcckschlo\u00df, K., Weitk\u00e4mper, F.: Exploiting the full power of Pearl\u2019s causality in probabilistic logic programming. In: Proceedings of the International Conference on Logic Programming 2022 Workshops. CEUR Workshop Proceedings, vol. 3193. CEUR-WS.org, Haifa, Israel (2022). http:\/\/ceur-ws.org\/Vol-3193\/paper1PLP.pdf"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Logic Programming: The 12th International Conference, pp. 715\u2013729. The MIT Press, Tokyo, Japan (1995). https:\/\/doi.org\/10.7551\/mitpress\/4298.003.0069","DOI":"10.7551\/mitpress\/4298.003.0069"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:07:55Z","timestamp":1703135275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49299-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492983","9783031492990"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49299-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}