{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T16:14:39Z","timestamp":1774455279438,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976065"],"award-info":[{"award-number":["61976065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1836205"],"award-info":[{"award-number":["U1836205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00354-020-00112-0","type":"journal-article","created":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T14:02:35Z","timestamp":1603548155000},"page":"273-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Learning Disjunctive Logic Programs from Nondeterministic Interpretation Transitions"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9750-5520","authenticated-orcid":false,"given":"Yi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yisong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,24]]},"reference":[{"issue":"20","key":"112_CR1","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S Muggleton","year":"1994","unstructured":"Muggleton, S., De Raedt, L.: Inductive logic programming: theory and methods. J. Logic Program. 19(20), 629\u2013679 (1994)","journal-title":"J. Logic Program."},{"issue":"11","key":"112_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/2736282","volume":"58","author":"S Gulwani","year":"2015","unstructured":"Gulwani, S., Hern\u00e1ndez-Orallo, J., Kitzelmann, E., Muggleton, S.H., Schmid, U., Zorn, B.: Inductive programming meets the real world. Commun. ACM 58(11), 90\u201399 (2015)","journal-title":"Commun. ACM"},{"issue":"5923","key":"112_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1126\/science.1165620","volume":"324","author":"RD King","year":"2009","unstructured":"King, R.D., Rowland, J., Oliver, S.G., Young, M., Aubrey, W., Byrne, E., Liakata, M., Markham, M., Pir, P., Soldatova, L.N., Sparkes, A., Whelan, K.E., Clare, A.: The automation of science. Science 324(5923), 85\u201389 (2009)","journal-title":"Science"},{"issue":"1","key":"112_CR4","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.A., Inoue, K., Srinivasan, A.: ILP turns 20\u2014biography and future challenges. Mach. Learn. 86(1), 3\u201323 (2012)","journal-title":"Mach. Learn."},{"issue":"3","key":"112_CR5","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.: Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol. 22(3), 437\u2013467 (1969)","journal-title":"J. Theor. Biol."},{"key":"112_CR6","volume-title":"A New Kind of Science","author":"S Wolfram","year":"2002","unstructured":"Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)"},{"key":"112_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-92675-9_3","volume-title":"Cellular Automata and Discrete Complex Systems","author":"T Chatain","year":"2018","unstructured":"Chatain, T., Haar, S., Paulev\u00e9, L.: Boolean networks: beyond generalized asynchronicity. In: Baetens, J.M., Kutrib, M. (eds.) Cellular Automata and Discrete Complex Systems, pp. 29\u201342. Springer International Publishing, Cham (2018)"},{"key":"112_CR8","unstructured":"Inoue, K.: Logic programming for boolean networks. In Walsh, T. (ed.) IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pp. 924\u2013930. IJCAI\/AAAI, (2011)"},{"key":"112_CR9","unstructured":"V\u00f6lker, M., Inoue, K.: Logic programming for cellular automata. In: Vos, M.\u00a0De, Eiter, T., Lierler, Y., Toni, F. (eds.) Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015), Cork, Ireland, August 31\u2013September 4, 2015, volume 1433 of CEUR Workshop Proceedings. CEUR-WS.org, (2015)"},{"issue":"5","key":"112_CR10","doi-asserted-by":"publisher","first-page":"055001","DOI":"10.1088\/1478-3975\/9\/5\/055001","volume":"9","author":"R-S Wang","year":"2012","unstructured":"Wang, R.-S., Saadatpour, A., Albert, R.: Boolean modeling in systems biology: an overview of methodology and applications. Phys. Biol. 9(5), 055001 (2012)","journal-title":"Phys. Biol."},{"issue":"1","key":"112_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ymeth.2012.10.012","volume":"62","author":"A Saadatpour","year":"2013","unstructured":"Saadatpour, A., Albert, R.: Boolean modeling of biological regulatory networks: a methodology tutorial. Methods 62(1), 3\u201312 (2013)","journal-title":"Methods"},{"key":"112_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jtbi.2016.08.006","volume":"408","author":"Q He","year":"2016","unstructured":"He, Q., Xia, Z., Lin, B.: An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks. J. Theor. Biol. 408, 137\u2013144 (2016)","journal-title":"J. Theor. Biol."},{"key":"112_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.jocs.2018.04.012","volume":"26","author":"NS Taou","year":"2018","unstructured":"Taou, N.S., Corne, D.W., Lones, M.A.: Investigating the use of Boolean networks for the control of gene regulatory networks. J. Comput. Sci. 26, 147\u2013156 (2018)","journal-title":"J. Comput. Sci."},{"issue":"1","key":"112_CR14","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."},{"key":"112_CR15","doi-asserted-by":"crossref","unstructured":"Ribeiro, T., Folschette, M., Magnin, M., Roux, O.F., Inoue, K.: Learning dynamics with synchronous, asynchronous and general semantics. In: Riguzzi, F., Bellodi, E., Zese, R. (eds.) Inductive Logic Programming\u201428th International Conference, ILP 2018, Ferrara, Italy, September 2\u20134, 2018, Proceedings, volume 11105 of Lecture Notes in Computer Science, pages 118\u2013140. Springer (2018)","DOI":"10.1007\/978-3-319-99960-9_8"},{"issue":"4","key":"112_CR16","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.: The semantics of predicate logic as a programming language. J. ACM 23(4), 733\u2013742 (1976)","journal-title":"J. ACM"},{"key":"112_CR17","unstructured":"Huang, Y., Wang, Y., Zhang, Y., Zhang, M.: Learning disjunctive logic programs from interpretation transition. In: Cussens, J., Russo, A. (eds.) Proceedings of the 26th International Conference on Inductive Logic Programming (Short papers), London, UK, 2016., volume 1865 of CEUR Workshop Proceedings, pages 34\u201340. CEUR-WS.org, (2016)"},{"issue":"3","key":"112_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1093\/logcom\/5.3.265","volume":"5","author":"C Sakama","year":"1995","unstructured":"Sakama, C., Inoue, K.: Paraconsistent stable semantics for extended disjunctive programs. J. Logic Comput. 5(3), 265\u2013285 (1995)","journal-title":"J. Logic Comput."},{"key":"112_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365\u2013385 (1991)","journal-title":"New Gener. Comput."},{"key":"112_CR20","unstructured":"Marek, V.W., Truszczynski, M.: Logic programs with abstract constraint atoms. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence (AAAI 2004), pages 86\u201391, San Jose, California, USA. AAAI Press (2004)"},{"key":"112_CR21","unstructured":"Liang, Shoudan, Fuhrman, S., Somogyi, R.: Reveal, a general reverse engineering algorithm for inference of genetic network architectures. in Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing, pp. 18\u201329 (1998)"},{"issue":"3","key":"112_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.jbiotec.2009.07.013","volume":"144","author":"F He","year":"2009","unstructured":"He, F., Balling, R., Zeng, A.-P.: Reverse engineering and verification of gene networks: principles, assumptions, and limitations of present methods and future perspectives. J. Biotechnol. 144(3), 190\u2013203 (2009). Systems Biology for Biotechnological Innovation","journal-title":"J. Biotechnol."},{"key":"112_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.biosystems.2018.10.008","volume":"174","author":"S Barbosa","year":"2018","unstructured":"Barbosa, S., Niebel, B., Wolf, S., Mauch, K., Takors, R.: A guide to gene regulatory network inference for obtaining predictive solutions: underlying assumptions and fundamental biological and data constraints. Biosystems 174, 37\u201348 (2018)","journal-title":"Biosystems"},{"issue":"5","key":"112_CR24","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.: A sat-based algorithm for finding attractors in synchronous Boolean networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(5), 1393\u20131399 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"4","key":"112_CR25","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/s00344-006-0068-8","volume":"25","author":"\u00c1 Chaos","year":"2006","unstructured":"Chaos, \u00c1., Aldana, M., Espinosa-Soto, C., de\u00a0Le\u00f3n, B.G.P., Arroyo, A.G., Alvarez-Buylla, E.R.: From genes to flower patterns and evolution: dynamic models of gene regulatory networks. J. Plant Growth Regul. 25(4), 278\u2013289 (2006)","journal-title":"J. Plant Growth Regul."},{"key":"112_CR26","doi-asserted-by":"publisher","DOI":"10.1186\/1742-4682-3-13","author":"L Mendoza","year":"2006","unstructured":"Mendoza, L., Xenarios, I.: A method for the generation of standardized qualitative dynamical systems of regulatory networks. Theor. Biol. Med. Model. (2006). https:\/\/doi.org\/10.1186\/1742-4682-3-13","journal-title":"Theor. Biol. Med. Model."},{"key":"112_CR27","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1186\/1471-2105-7-56","volume":"7","author":"S Klamt","year":"2006","unstructured":"Klamt, S., Saez-Rodriguez, J., Lindquist, J.A., Simeoni, L., Gilles, E.D.: A methodology for the structural and functional analysis of signaling and regulatory networks. BMC Bioinform. 7, 56 (2006)","journal-title":"BMC Bioinform."},{"key":"112_CR28","doi-asserted-by":"crossref","unstructured":"Faur\u00e9, A., Naldi, A., Chaouiya, C., Thieffry, D.: Dynamical analysis of a generic boolean model for the control of the mammalian cell cycle. In: Proceedings 14th International Conference on Intelligent Systems for Molecular Biology 2006, Fortaleza, Brazil, August 6-10, 2006, pp. 124\u2013131 (2006)","DOI":"10.1093\/bioinformatics\/btl210"},{"issue":"2","key":"112_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0001672","volume":"3","author":"MI Davidich","year":"2008","unstructured":"Davidich, M.I., Bornholdt, S.: Boolean network model predicts cell cycle sequence of fission yeast. PLoS One 3(2), 1\u20138 (2008)","journal-title":"PLoS One"},{"issue":"14","key":"112_CR30","doi-asserted-by":"publisher","first-page":"4781","DOI":"10.1073\/pnas.0305937101","volume":"101","author":"F Li","year":"2004","unstructured":"Li, F., Long, T., Ying, L., Ouyang, Q., Tang, C.: The yeast cell-cycle network is robustly designed. Proc. Natl. Acad. Sci. 101(14), 4781\u20134786 (2004)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"112_CR31","unstructured":"Inoue, K., Kudoh, Y.: Learning extended logic programs. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, August 23\u201329, 1997, Vol. 2, pp. 176\u2013181. Morgan Kaufmann (1997)"},{"issue":"2","key":"112_CR32","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/1055686.1055687","volume":"6","author":"C Sakama","year":"2005","unstructured":"Sakama, C.: Induction from answer sets in nonmonotonic logic programs. ACM Trans. Comput. Log. 6(2), 203\u2013231 (2005)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1","key":"112_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-009-5113-y","volume":"76","author":"C Sakama","year":"2009","unstructured":"Sakama, C., Inoue, K.: Brave induction: a logical framework for learning from incomplete information. Mach. Learn. 76(1), 3\u201335 (2009)","journal-title":"Mach. Learn."},{"key":"112_CR34","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.artint.2018.03.005","volume":"259","author":"M Law","year":"2018","unstructured":"Law, M., Russo, A., Broda, K.: The complexity and generality of learning answer set programs. Artif. Intell. 259, 110\u2013146 (2018)","journal-title":"Artif. Intell."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-020-00112-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00354-020-00112-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-020-00112-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T19:16:03Z","timestamp":1635016563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00354-020-00112-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,24]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["112"],"URL":"https:\/\/doi.org\/10.1007\/s00354-020-00112-0","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,24]]},"assertion":[{"value":"12 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}