{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:14:50Z","timestamp":1743088490377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030974534"},{"type":"electronic","value":"9783030974541"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-97454-1_2","type":"book-chapter","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:02:28Z","timestamp":1645646548000},"page":"17-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Conjecturing of P-Recursions Using Lifted Inference"],"prefix":"10.1007","author":[{"given":"J\u00e1chym","family":"Barv\u00ednek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy","family":"van Bremen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuyi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"\u017delezn\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Ku\u017eelka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Beame, P., Van den Broeck, G., Gribkoff, E., Suciu, D.: Symmetric weighted first-order model counting. In: PODS, pp. 313\u2013328. ACM (2015)","DOI":"10.1145\/2745754.2745760"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Berthomieu, J., Faug\u00e8re, J.C.: Guessing linear recurrence relations of sequence tuples and p-recursive sequences with linear algebra. In: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp. 95\u2013102 (2016)","DOI":"10.1145\/2930889.2930926"},{"key":"2_CR3","unstructured":"van Bremen, T., Kuzelka, O.: Faster lifting for two-variable logic using cell graphs. In: Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, UAI 2021, pp. 1393\u20131402 (2021)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Colton, S.: Automated conjecture making in number theory using HR, otter and maple. J. Symb. Comput. 39(5), 593\u2013615 (2005)","DOI":"10.1016\/j.jsc.2004.12.003"},{"key":"2_CR5","unstructured":"Colton, S., Bundy, A., Walsh, T.: Automatic invention of integer sequences. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, 30 July\u20133 August 2000, Austin, Texas, USA, pp. 558\u2013563 (2000)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)","DOI":"10.1017\/CBO9780511801655"},{"key":"2_CR7","unstructured":"Gogate, V., Domingos, P.M.: Probabilistic Theorem Proving. In: UAI, pp. 256\u2013265. AUAI Press (2011)"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/421196","volume":"3","author":"E Gr\u00e4del","year":"1997","unstructured":"Gr\u00e4del, E., Kolaitis, P.G., Vardi, M.Y.: On the decision problem for two-variable first-order logic. Bull. Symb. Log. 3(1), 53\u201369 (1997)","journal-title":"Bull. Symb. Log."},{"key":"2_CR9","unstructured":"Kazemi, S.M., Kimmig, A., Van den Broeck, G., Poole, D.: New liftable classes for first-order probabilistic inference. In: NIPS, pp. 3117\u20133125 (2016)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kuusisto, A., Lutz, C.: Weighted model counting beyond two-variable logic. In: LICS, pp. 619\u2013628. ACM (2018)","DOI":"10.1145\/3209108.3209168"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1613\/jair.1.12320","volume":"70","author":"O Kuzelka","year":"2021","unstructured":"Kuzelka, O.: Weighted first-order model counting in the two-variable fragment with counting quantifiers. J. Artif. Intell. Res. 70, 1281\u20131307 (2021)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR12","unstructured":"Poole, D.: First-order probabilistic inference. In: IJCAI, pp. 985\u2013991. Morgan Kaufmann (2003)"},{"key":"2_CR13","unstructured":"de Salvo Braz, R., Amir, E., Roth, D.: Lifted first-order probabilistic inference. In: IJCAI, pp. 1319\u20131325. Professional Book Center (2005)"},{"key":"2_CR14","unstructured":"Van den Broeck, G.: On the completeness of first-order knowledge compilation for lifted probabilistic inference. In: NIPS, pp. 1386\u20131394 (2011)"},{"key":"2_CR15","unstructured":"Van den Broeck, G., Meert, W., Darwiche, A.: Skolemization for weighted first-order model counting. In: KR. AAAI Press (2014)"},{"key":"2_CR16","unstructured":"Wolfram Research Inc: Mathematica, Version 12.2 (2020). https:\/\/www.wolfram.com\/mathematica, champaign, IL (2020)"}],"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-030-97454-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:02:57Z","timestamp":1645646577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97454-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030974534","9783030974541"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97454-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 February 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lr2020.iit.demokritos.gr\/","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":"10","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":"16","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":"3","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":"160% - 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)"}}]}}