{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:05:40Z","timestamp":1760043940526,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031742088"},{"type":"electronic","value":"9783031742095"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-74209-5_8","type":"book-chapter","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T06:01:44Z","timestamp":1728626504000},"page":"98-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Abstract Dialectical Frameworks are Boolean Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3825-4052","authenticated-orcid":false,"given":"Jesse","family":"Heyninck","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1826-1498","authenticated-orcid":false,"given":"Matthias","family":"Knorr","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6786-7360","authenticated-orcid":false,"given":"Jo\u00e3o","family":"Leite","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718539","volume-title":"Discrete Mathematics of Neural Networks: Selected Topics","author":"M Anthony","year":"2001","unstructured":"Anthony, M.: Discrete Mathematics of Neural Networks: Selected Topics. SIAM, New Delhi (2001)"},{"issue":"50","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1007\/s11538-008-9304-7","volume":"70","author":"J Aracena","year":"2008","unstructured":"Aracena, J.: Maximum number of fixed points in regulatory Boolean networks. Bull. Math. Biol. 70(50), 1398\u20131409 (2008)","journal-title":"Bull. Math. Biol."},{"key":"8_CR3","unstructured":"Brewka, G., Strass, H., Ellmauthaler, S., Wallner, J.P., Woltran, S.: Abstract dialectical frameworks revisited. In: Proceedings of the ICJAI (2013)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jcss.2022.01.004","volume":"126","author":"F Bridoux","year":"2022","unstructured":"Bridoux, F., Durbec, A., Perrot, K., Richard, A.: Complexity of fixed point counting problems in Boolean networks. J. Comput. Syst. Sci. 126, 138\u2013164 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11518655_33","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"C Cayrol","year":"2005","unstructured":"Cayrol, C., Lagasquie-Schiex, M.C.: On the acceptability of arguments in bipolar argumentation frameworks. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 378\u2013389. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11518655_33"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. AI 77, 321\u2013358 (1995)","DOI":"10.1016\/0004-3702(94)00041-X"},{"issue":"14","key":"8_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1093\/bioinformatics\/btl210","volume":"22","author":"A Faure","year":"2006","unstructured":"Faure, A., Naldi, A., Chaouiya, C., Thieffry, D.: Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle. ISMB (Supplement Bioinform.) 22(14), 124\u2013131 (2006)","journal-title":"ISMB (Supplement Bioinform.)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Hecher, M., Meier, A.: Counting complexity for reasoning in abstract argumentation. In: Proceedings of the AAAI, pp. 2827\u20132834 (2019)","DOI":"10.1609\/aaai.v33i01.33012827"},{"issue":"17","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1093\/bioinformatics\/btn336","volume":"24","author":"A Garg","year":"2008","unstructured":"Garg, A., Cara, A.D., Xenarios, I., Mendoza, L., Micheli, G.D.: Synchronous versus asynchronous modeling of gene regulatory networks. Bioinformatics 24(17), 1917\u20131925 (2008)","journal-title":"Bioinformatics"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0022-5193(73)90208-7","volume":"39","author":"L Glass","year":"1973","unstructured":"Glass, L., Kauffman, S.A.: The logical analysis of continuous, non-linear biochemical control networks. J. Theor. Biol. 39(1), 103\u2013129 (1973)","journal-title":"J. Theor. Biol."},{"key":"8_CR11","unstructured":"Gouveia, F.: Model Revision of Boolean Logical Models of Biological Regulatory Networks. Ph.D. thesis, Instituto Superior T\u00e9cnico, Universidade de Lisboa (2021)"},{"key":"8_CR12","unstructured":"Heyninck, J., Kern-Isberner, G.: An epistemic interpretation of abstract dialectical argumentation. In: Computational Models of Argument, pp. 227\u2013238 (2020)"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00180-012-0324-2","volume":"28","author":"M Hopfensitz","year":"2012","unstructured":"Hopfensitz, M., M\u00fcssel, C., Maucher, M., Kestler, H.A.: Attractors in Boolean networks: a tutorial. Comput. Stat. 28(1), 19\u201336 (2012)","journal-title":"Comput. Stat."},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Klarner, H., Bockmayr, A., Siebert, H.: Computing symbolic steady states of Boolean networks. In: Was, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 561\u2013570. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11520-7_59","DOI":"10.1007\/978-3-319-11520-7_59"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s11047-015-9520-7","volume":"14","author":"H Klarner","year":"2015","unstructured":"Klarner, H., Bockmayr, A., Siebert, H.: Computing maximal and minimal trap spaces of Boolean networks. Nat. Comput. 14(4), 535\u2013544 (2015)","journal-title":"Nat. Comput."},{"key":"8_CR16","unstructured":"Moon, K., Lee, K., Paulev\u00e9, L.: Computational complexity of minimal trap spaces in Boolean networks. arXiv preprint arXiv:2212.12756 (2022)"},{"issue":"21","key":"8_CR17","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1016\/j.tcs.2010.10.021","volume":"412","author":"A Naldi","year":"2011","unstructured":"Naldi, A., Remy, E., Thieffry, D., Chaouiya, C.: Dynamically consistent reduction of logical regulatory graphs. Theor. Comput. Sci. 412(21), 2207\u20132218 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-319-48758-8_28","volume-title":"Logics in Artificial Intelligence","author":"S Polberg","year":"2016","unstructured":"Polberg, S.: Understanding the abstract dialectical framework. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 430\u2013446. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48758-8_28"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.aam.2007.11.003","volume":"41","author":"\u00c9 Remy","year":"2008","unstructured":"Remy, \u00c9., Ruet, P., Thieffry, D.: Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework. Adv. Appl. Math. 41(3), 335\u2013350 (2008)","journal-title":"Adv. Appl. Math."},{"issue":"4","key":"8_CR20","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.aam.2009.11.011","volume":"44","author":"A Richard","year":"2010","unstructured":"Richard, A.: Negative circuits and sustained oscillations in asynchronous automata networks. Adv. Appl. Math. 44(4), 378\u2013392 (2010)","journal-title":"Adv. Appl. Math."},{"issue":"11","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.dam.2011.01.010","volume":"159","author":"A Richard","year":"2011","unstructured":"Richard, A.: Local negative circuits and fixed points in non-expansive Boolean networks. Discret. Appl. Math. 159(11), 1085\u20131093 (2011)","journal-title":"Discret. Appl. Math."},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0024-3795(80)90251-7","volume":"29","author":"F Robert","year":"1980","unstructured":"Robert, F.: Iterations sur des ensembles finis et automates cellulaires contractants. Linear Algebra Appl. 29, 393\u2013412 (1980)","journal-title":"Linear Algebra Appl."},{"key":"8_CR23","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-030-92551-2_15","volume-title":"Automata and Complexity","author":"L Salinas","year":"2022","unstructured":"Salinas, L., G\u00f3mez, L., Aracena, J.: Existence and non existence of limit cycles in Boolean networks. In: Adamatzky, A. (ed.) Automata and Complexity. Emergence, Complexity and Computation, vol. 42, pp. 233\u2013252. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-92551-2_15"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.csbj.2020.03.001","volume":"18","author":"JD Schwab","year":"2020","unstructured":"Schwab, J.D., K\u00fchlwein, S.D., Ikonomi, N., K\u00fchl, M., Kestler, H.A.: Concepts in Boolean network modeling: what do they all mean. Comput. Struct. Biotechnol. 18, 571\u2013582 (2020)","journal-title":"Comput. Struct. Biotechnol."},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.artint.2013.09.004","volume":"205","author":"H Strass","year":"2013","unstructured":"Strass, H.: Approximating operators and semantics for abstract dialectical frameworks. Artif. Intell. 205, 39\u201370 (2013)","journal-title":"Artif. Intell."},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1613\/jair.4879","volume":"54","author":"H Strass","year":"2015","unstructured":"Strass, H.: Expressiveness of two-valued semantics for abstract dialectical frameworks. J. Artif. Intell. Res. 54, 193\u2013231 (2015)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"8_CR27","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/0022-5193(73)90247-6","volume":"42","author":"R Thomas","year":"1973","unstructured":"Thomas, R.: Boolean formalization of genetic control circuits. J. Theor. Biol. 42(3), 563\u2013585 (1973)","journal-title":"J. Theor. Biol."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74209-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:02:48Z","timestamp":1736614968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74209-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031742088","9783031742095"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74209-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2024.demacs.unical.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}