{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T12:41:42Z","timestamp":1780058502095,"version":"3.54.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T00:00:00Z","timestamp":1637712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T00:00:00Z","timestamp":1637712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["P17H00763"],"award-info":[{"award-number":["P17H00763"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"name":"\u201cPays dela Loire\u201d Region through RFI Atlanstic 2020"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10994-021-06105-4","type":"journal-article","created":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T21:02:35Z","timestamp":1637787755000},"page":"3593-3670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Learning any memory-less discrete semantics for dynamical systems represented by logic programs"],"prefix":"10.1007","volume":"111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1793-2854","authenticated-orcid":false,"given":"Tony","family":"Ribeiro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maxime","family":"Folschette","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Morgan","family":"Magnin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,24]]},"reference":[{"issue":"1","key":"6105_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0304-3975(02)00425-5","volume":"298","author":"T Akutsu","year":"2003","unstructured":"Akutsu, T., Kuhara, S., Maruyama, O., & Miyano, S. (2003). Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model. Theoretical Computer Science, 298(1), 235\u2013251.","journal-title":"Theoretical Computer Science"},{"key":"6105_CR2","doi-asserted-by":"crossref","unstructured":"Apt, K. R., Blair, H. A., & Walker, A. (1988). Towards a theory of declarative knowledge. Foundations of deductive databases and logic programming p.\u00a089","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"issue":"7","key":"6105_CR3","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1007\/s10994-018-5709-1","volume":"107","author":"M Bain","year":"2018","unstructured":"Bain, M., & Srinivasan, A. (2018). Identification of biological transition systems using meta-interpreted logic programs. Machine Learning, 107(7), 1171\u20131206.","journal-title":"Machine Learning"},{"issue":"2","key":"6105_CR4","first-page":"45","volume":"5","author":"HA Blair","year":"1988","unstructured":"Blair, H. A., & Subrahmanian, V. (1988). Paraconsistent foundations for logic programming. Journal of Non-classical Logic, 5(2), 45\u201373.","journal-title":"Journal of Non-classical Logic"},{"issue":"2","key":"6105_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(89)90126-6","volume":"68","author":"HA Blair","year":"1989","unstructured":"Blair, H. A., & Subrahmanian, V. (1989). Paraconsistent logic programming. Theoretical Computer Science, 68(2), 135\u2013154. https:\/\/doi.org\/10.1016\/0304-3975(89)90126-6","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6105_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s11047-019-09748-4","volume":"19","author":"T Chatain","year":"2020","unstructured":"Chatain, T., Haar, S., Kol\u010d\u00e1k, J., Paulev\u00e9, L., & Thakkar, A. (2020). Concurrency in boolean networks. Natural Computing, 19(1), 91\u2013109.","journal-title":"Natural Computing"},{"key":"6105_CR7","doi-asserted-by":"crossref","unstructured":"Chatain, T., Haar, S., Koutny, M., & Schwoon, S. (2015). Non-atomic transition firing in contextual nets. In International conference on applications and theory of petri nets and concurrency (pp. 117\u2013136). Springer.","DOI":"10.1007\/978-3-319-19488-2_6"},{"key":"6105_CR8","doi-asserted-by":"crossref","unstructured":"Chatain, T., Haar, S., & Paulev\u00e9, L. (2018). Boolean networks: Beyond generalized asynchronicity. In AUTOMATA 2018. Springer.","DOI":"10.1007\/978-3-319-92675-9_3"},{"key":"6105_CR9","doi-asserted-by":"publisher","unstructured":"Cropper, A., Duman\u010di\u0107, S., & Muggleton, S.H. (2020). Turning 30: New ideas in inductive logic programming. In Bessiere, C. (Ed.), Proceedings of the twenty-ninth international joint conference on artificial intelligence, IJCAI-20 (pp. 4833\u20134839). International Joint Conferences on Artificial Intelligence Organization. https:\/\/doi.org\/10.24963\/ijcai.2020\/673. Survey track","DOI":"10.24963\/ijcai.2020\/673"},{"issue":"2","key":"6105_CR10","doi-asserted-by":"publisher","first-page":"e1672","DOI":"10.1371\/journal.pone.0001672","volume":"3","author":"MI Davidich","year":"2008","unstructured":"Davidich, M. I., & Bornholdt, S. (2008). Boolean network model predicts cell cycle sequence of fission yeast. PLoS ONE, 3(2), e1672.","journal-title":"PLoS ONE"},{"issue":"5","key":"6105_CR11","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1109\/TCBB.2010.20","volume":"8","author":"E Dubrova","year":"2011","unstructured":"Dubrova, E., & Teslenko, M. (2011). A SAT-based algorithm for finding attractors in synchronous boolean networks. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 8(5), 1393\u20131399.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB)"},{"key":"6105_CR12","unstructured":"Evans, R., Hernandez-Orallo, J., Welbl, J., Kohli, P., & Sergot, M. (2019). Making sense of sensory input. arXiv preprint arXiv:1910.02227"},{"key":"6105_CR13","unstructured":"Evans, R., Hernandez-Orallo, J., Welbl, J., Kohli, P., & Sergot, M. (2020). Evaluating the apperception engine. arXiv preprint arXiv:2007.05367"},{"key":"6105_CR14","doi-asserted-by":"crossref","unstructured":"Fages, F. (2020). Artificial intelligence in biological modelling. In A guided tour of artificial intelligence research (pp. 265\u2013302). Springer.","DOI":"10.1007\/978-3-030-06170-8_8"},{"issue":"14","key":"6105_CR15","doi-asserted-by":"publisher","first-page":"e124","DOI":"10.1093\/bioinformatics\/btl210","volume":"22","author":"A Faur\u00e9","year":"2006","unstructured":"Faur\u00e9, A., Naldi, A., Chaouiya, C., & Thieffry, D. (2006). Dynamical analysis of a generic boolean model for the control of the mammalian cell cycle. Bioinformatics, 22(14), e124\u2013e131.","journal-title":"Bioinformatics"},{"issue":"2","key":"6105_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)90014-G","volume":"11","author":"M Fitting","year":"1991","unstructured":"Fitting, M. (1991). Bilattices and the semantics of logic programming. The Journal of Logic Programming, 11(2), 91\u2013116. https:\/\/doi.org\/10.1016\/0743-1066(91)90014-G","journal-title":"The Journal of Logic Programming"},{"key":"6105_CR17","doi-asserted-by":"publisher","unstructured":"Gibart., L., Bernot., G., Collavizza., H., & Comet., J. (2021) Totembionet enrichment methodology: Application to the qualitative regulatory network of the cell metabolism. In Proceedings of the 14th international joint conference on biomedical engineering systems and technologies (BIOINFORMATICS) (pp. 85\u201392). INSTICC, SciTePress. https:\/\/doi.org\/10.5220\/0010186200850092.","DOI":"10.5220\/0010186200850092"},{"issue":"3","key":"6105_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1111\/j.1467-8640.1988.tb00280.x","volume":"4","author":"ML Ginsberg","year":"1988","unstructured":"Ginsberg, M. L. (1988). Multivalued logics: A uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4(3), 265\u2013316.","journal-title":"Computational Intelligence"},{"key":"6105_CR19","unstructured":"Inoue, K. (2011). Logic programming for boolean networks. In Proceedings of the twenty-second international joint conference on artificial intelligence, IJCAI\u201911 (Vol.\u00a02, pp. 924\u2013930). AAAI Press."},{"issue":"1","key":"6105_CR20","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. (2014). Learning from interpretation transition. Machine Learning, 94(1), 51\u201379.","journal-title":"Machine Learning"},{"key":"6105_CR21","doi-asserted-by":"crossref","unstructured":"Inoue, K., & Sakama, C. (2012). Oscillating behavior of logic programs. Correct Reasoning (pp. 345\u2013362). Springer.","DOI":"10.1007\/978-3-642-30743-0_23"},{"key":"6105_CR22","unstructured":"Islam, S. R., Eberle, W., & Ghafoor, S. K. (2020). Towards quantification of explainability in explainable artificial intelligence methods. In The thirty-third international flairs conference."},{"issue":"1","key":"6105_CR23","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1038\/msb.2008.43","volume":"4","author":"S Kaplan","year":"2008","unstructured":"Kaplan, S., Bren, A., Dekel, E., & Alon, U. (2008). The incoherent feed-forward loop can generate non-monotonic input functions for genes. Molecular Systems Biology, 4(1), 203.","journal-title":"Molecular Systems Biology"},{"issue":"2\u20133","key":"6105_CR24","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. (2015). Incremental learning of event definitions with inductive logic programming. Machine Learning, 100(2\u20133), 555\u2013585.","journal-title":"Machine Learning"},{"issue":"3","key":"6105_CR25","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","volume":"22","author":"SA Kauffman","year":"1969","unstructured":"Kauffman, S. A. (1969). Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology, 22(3), 437\u2013467.","journal-title":"Journal of Theoretical Biology"},{"issue":"4","key":"6105_CR26","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0743-1066(92)90007-P","volume":"12","author":"M Kifer","year":"1992","unstructured":"Kifer, M., & Subrahmanian, V. (1992). Theory of generalized annotated logic programming and its applications. Journal of Logic Programming, 12(4), 335\u2013367.","journal-title":"Journal of Logic Programming"},{"key":"6105_CR27","doi-asserted-by":"crossref","unstructured":"Klarner, H., Bockmayr, A., & Siebert, H. (2014). Computing symbolic steady states of boolean networks. In Cellular automata (pp. 561\u2013570). Springer.","DOI":"10.1007\/978-3-319-11520-7_59"},{"issue":"5","key":"6105_CR28","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1093\/bioinformatics\/btw682","volume":"33","author":"H Klarner","year":"2016","unstructured":"Klarner, H., Streck, A., & Siebert, H. (2016). PyBoolNet: A python package for the generation, analysis and visualization of boolean networks. Bioinformatics, 33(5), 770\u2013772. https:\/\/doi.org\/10.1093\/bioinformatics\/btw682","journal-title":"Bioinformatics"},{"issue":"1\u20132","key":"6105_CR29","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1023905711304","volume":"52","author":"H L\u00e4hdesm\u00e4ki","year":"2003","unstructured":"L\u00e4hdesm\u00e4ki, H., Shmulevich, I., & Yli-Harja, O. (2003). On learning gene regulatory networks under the boolean network model. Machine Learning, 52(1\u20132), 147\u2013167.","journal-title":"Machine Learning"},{"issue":"5\u20136","key":"6105_CR30","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1017\/S1471068416000351","volume":"16","author":"M Law","year":"2016","unstructured":"Law, M., Russo, A., & Broda, K. (2016). Iterative learning of answer set programs from context dependent examples. Theory and Practice of Logic Programming, 16(5\u20136), 834\u2013848. https:\/\/doi.org\/10.1017\/S1471068416000351","journal-title":"Theory and Practice of Logic Programming"},{"key":"6105_CR31","unstructured":"Liang, S., Fuhrman, S., & Somogyi, R. (1998). Reveal, a general reverse engineering algorithm for inference of genetic network architectures. In Proceedings of the 3rd pacific symposium on biocomputing (pp. 18\u201329)."},{"key":"6105_CR32","doi-asserted-by":"crossref","unstructured":"Mart\u0131nez, D., Alenya, G., Torras, C., Ribeiro, T., & Inoue, K. (2016). Learning relational dynamics of stochastic domains for planning. In Proceedings of the 26th international conference on automated planning and scheduling.","DOI":"10.1609\/icaps.v26i1.13746"},{"key":"6105_CR33","unstructured":"Mart\u00ednez\u00a0Mart\u00ednez, D., Ribeiro, T., Inoue, K., Aleny\u00e0\u00a0Ribas, G., & Torras, C. (2015). Learning probabilistic action models from interpretation transitions. In Proceedings of the technical communications of the 31st international conference on logic programming (ICLP 2015) (pp. 1\u201314)."},{"issue":"3\u20134","key":"6105_CR34","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S Muggleton","year":"1995","unstructured":"Muggleton, S. (1995). Inverse entailment and progol. New Generation Computing, 13(3\u20134), 245\u2013286.","journal-title":"New Generation Computing"},{"key":"6105_CR35","doi-asserted-by":"crossref","unstructured":"Muggleton, S. (1996). Learning from positive data. In International conference on inductive logic programming (pp. 358\u2013376). Springer.","DOI":"10.1007\/3-540-63494-0_65"},{"issue":"1","key":"6105_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-011-5259-2","volume":"86","author":"S Muggleton","year":"2012","unstructured":"Muggleton, S., De Raedt, L., Poole, D., Bratko, I., Flach, P., Inoue, K., & Srinivasan, A. (2012). Ilp turns 20. Machine learning, 86(1), 3\u201323.","journal-title":"Machine learning"},{"issue":"7","key":"6105_CR37","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1007\/s10994-018-5707-3","volume":"107","author":"SH Muggleton","year":"2018","unstructured":"Muggleton, S. H., Schmid, U., Zeller, C., Tamaddoni-Nezhad, A., & Besold, T. (2018). Ultra-strong machine learning: Comprehensibility of programs learned with ILP. Machine Learning, 107(7), 1119\u20131140.","journal-title":"Machine Learning"},{"key":"6105_CR38","doi-asserted-by":"crossref","unstructured":"Naldi, A., Hernandez, C., Abou-Jaoud\u00e9, W., Monteiro, P. T., Chaouiya, C., & Thieffry, D. (2018). Logical modeling and analysis of cellular regulatory networks with Ginsim 3.0. Frontiers in Physiology, 9, 646.","DOI":"10.3389\/fphys.2018.00646"},{"issue":"2","key":"6105_CR39","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s11047-016-9608-8","volume":"17","author":"M Noual","year":"2018","unstructured":"Noual, M., & Sen\u00e9, S. (2018). Synchronism versus asynchronism in monotonic boolean automata networks. Natural Computing, 17(2), 393\u2013402.","journal-title":"Natural Computing"},{"issue":"4","key":"6105_CR40","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jtbi.2004.04.039","volume":"230","author":"B Nov\u00e1k","year":"2004","unstructured":"Nov\u00e1k, B., & Tyson, J. J. (2004). A model for restriction point control of the mammalian cell cycle. Journal of Theoretical Biology, 230(4), 563\u2013579.","journal-title":"Journal of Theoretical Biology"},{"issue":"v1","key":"6105_CR41","first-page":"1","volume":"1","author":"A Ortega","year":"2020","unstructured":"Ortega, A., Fierrez, J., Morales, A., Wang, Z., & Ribeiro, T. (2020). Symbolic AI for XAI: Evaluating LFIT inductive programming for fair and explainable automatic recruitment. Target, 1(v1), 1.","journal-title":"Target"},{"issue":"21","key":"6105_CR42","doi-asserted-by":"publisher","first-page":"4021","DOI":"10.1093\/bioinformatics\/bti664","volume":"21","author":"R Pal","year":"2005","unstructured":"Pal, R., Ivanov, I., Datta, A., Bittner, M. L., & Dougherty, E. R. (2005). Generating boolean networks with a prescribed attractor structure. Bioinformatics, 21(21), 4021\u20134025.","journal-title":"Bioinformatics"},{"key":"6105_CR43","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1613\/jair.2113","volume":"29","author":"HM Pasula","year":"2007","unstructured":"Pasula, H. M., Zettlemoyer, L. S., & Kaelbling, L. P. (2007). Learning symbolic models of stochastic domains. Journal of Artificial Intelligence Research, 29, 309\u2013352.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6105_CR44","doi-asserted-by":"crossref","unstructured":"Paulev\u00e9, L., Kol\u010d\u00e1k, J., Chatain, T., & Haar, S. (2020). Reconciling qualitative, abstract, and scalable modeling of biological networks. bioRxiv.","DOI":"10.1101\/2020.03.22.998377"},{"issue":"3","key":"6105_CR45","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.jal.2008.10.007","volume":"7","author":"O Ray","year":"2009","unstructured":"Ray, O. (2009). Nonmonotonic abductive inductive learning. Journal of Applied Logic, 7(3), 329\u2013340.","journal-title":"Journal of Applied Logic"},{"key":"6105_CR46","doi-asserted-by":"crossref","unstructured":"Ribeiro, T., Folschette, M., Magnin, M., Roux, O., & Inoue, K. (2018). Learning dynamics with synchronous, asynchronous and general semantics. In International conference on inductive logic programming (pp. 118\u2013140). Springer.","DOI":"10.1007\/978-3-319-99960-9_8"},{"key":"6105_CR47","unstructured":"Ribeiro, T., Folschette, M., Trilling, L., Glade, N., Inoue, K., Magnin, M., & Roux, O. (2020). Les enjeux de l\u2019inf\u00e9rence de mod\u00e8les dynamiques des syst\u00e8mes biologiques \u00e0 partir de s\u00e9ries temporelles. In C. Lhoussaine & E. Remy (Eds.), Approches symboliques de la mod\u00e9lisation et de l\u2019analyse des syst\u00e8mes biologiques. ISTE Editions. In edition."},{"key":"6105_CR48","doi-asserted-by":"crossref","unstructured":"Ribeiro, T., & Inoue, K. (2015). Learning prime implicant conditions from interpretation transition. In Inductive logic programming (pp. 108\u2013125). Springer.","DOI":"10.1007\/978-3-319-23708-4_8"},{"key":"6105_CR49","doi-asserted-by":"publisher","first-page":"81","DOI":"10.3389\/fbioe.2014.00081","volume":"2","author":"T Ribeiro","year":"2015","unstructured":"Ribeiro, T., Magnin, M., Inoue, K., & Sakama, C. (2015a). Learning delayed influences of biological systems. Frontiers in Bioengineering and Biotechnology, 2, 81.","journal-title":"Frontiers in Bioengineering and Biotechnology"},{"key":"6105_CR50","doi-asserted-by":"publisher","unstructured":"Ribeiro, T., Magnin, M., Inoue, K., & Sakama, C. (2015b). Learning multi-valued biological models with delayed influence from time-series observations. In 2015 IEEE 14th international conference on machine learning and applications (ICMLA) (pp. 25\u201331). https:\/\/doi.org\/10.1109\/ICMLA.2015.19","DOI":"10.1109\/ICMLA.2015.19"},{"key":"6105_CR51","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-78090-0_9","volume-title":"Inductive logic programming","author":"T Ribeiro","year":"2018","unstructured":"Ribeiro, T., Tourret, S., Folschette, M., Magnin, M., Borzacchiello, D., Chinesta, F., Roux, O., & Inoue, K. (2018). Inductive learning from state transitions over continuous domains. In N. Lachiche & C. Vrain (Eds.), Inductive logic programming (pp. 124\u2013139). Cham: Springer International Publishing."},{"issue":"7","key":"6105_CR52","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1007\/s10994-018-5708-2","volume":"107","author":"P Sch\u00fcller","year":"2018","unstructured":"Sch\u00fcller, P., & Benz, M. (2018). Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. Machine Learning, 107(7), 1141\u20131169.","journal-title":"Machine Learning"},{"key":"6105_CR53","unstructured":"Srinivasan, A. (2001). The aleph manual."},{"key":"6105_CR54","doi-asserted-by":"crossref","unstructured":"Thieffry, D., & Thomas, R. (1995). Dynamical behaviour of biological regulatory networks-II. Immunity control in bacteriophage lambda. Bulletin of Mathematical Biology, 57(2), 277\u2013297.","DOI":"10.1016\/0092-8240(94)00037-D"},{"issue":"1","key":"6105_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-5193(05)80350-9","volume":"153","author":"R Thomas","year":"1991","unstructured":"Thomas, R. (1991). Regulatory networks seen as asynchronous automata: A logical description. Journal of Theoretical Biology, 153(1), 1\u201323.","journal-title":"Journal of Theoretical Biology"},{"issue":"1","key":"6105_CR56","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0743-1066(86)90003-8","volume":"3","author":"MH Van Emden","year":"1986","unstructured":"Van Emden, M. H. (1986). Quantitative deduction and its fixpoint theory. The Journal of Logic Programming, 3(1), 37\u201353.","journal-title":"The Journal of Logic Programming"},{"issue":"4","key":"6105_CR57","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"MH Van Emden","year":"1976","unstructured":"Van Emden, M. H., & Kowalski, R. A. (1976). The semantics of predicate logic as a programming language. Journal of the ACM (JACM), 23(4), 733\u2013742.","journal-title":"Journal of the ACM (JACM)"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06105-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-06105-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06105-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T16:33:29Z","timestamp":1669307609000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-06105-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,24]]},"references-count":57,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["6105"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-06105-4","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,24]]},"assertion":[{"value":"1 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}