{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:03:26Z","timestamp":1772755406192,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031426964","type":"print"},{"value":"9783031426971","type":"electronic"}],"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-42697-1_11","type":"book-chapter","created":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T09:02:29Z","timestamp":1694163749000},"page":"157-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tackling Universal Properties of\u00a0Minimal Trap Spaces of\u00a0Boolean Networks"],"prefix":"10.1007","author":[{"given":"Sara","family":"Riva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marie","family":"Lagniez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo Maga\u00f1a","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lo\u00efc","family":"Paulev\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,9]]},"reference":[{"key":"11_CR1","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, 1398\u20131409 (2008). https:\/\/doi.org\/10.1007\/s11538-008-9304-7","journal-title":"Bull. Math. Biol."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TNN.2003.821555","volume":"15","author":"J Aracena","year":"2004","unstructured":"Aracena, J., Demongeot, J., Goles, E.: Positive and negative circuits in discrete neural networks. IEEE Trans. Neural Netw. 15(1), 77\u201383 (2004). https:\/\/doi.org\/10.1109\/TNN.2003.821555","journal-title":"IEEE Trans. Neural Netw."},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press (2003). https:\/\/doi.org\/10.1017\/CBO9780511543357","DOI":"10.1017\/CBO9780511543357"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-030-53288-8_28","volume-title":"Computer Aided Verification","author":"N Bene\u0161","year":"2020","unstructured":"Bene\u0161, N., Brim, L., Kadlecaj, J., Pastva, S., \u0160afr\u00e1nek, D.: AEON: attractor bifurcation analysis of parametrised Boolean networks. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 569\u2013581. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_28"},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1109\/tcbb.2018.2889102","volume":"16","author":"C Biane","year":"2018","unstructured":"Biane, C., Delaplace, F.: Causal reasoning on Boolean control networks based on abduction: theory and application to cancer drug discovery. IEEE\/ACM Trans. Comput. Biol. Bioinf. 16(5), 1574\u20131585 (2018). https:\/\/doi.org\/10.1109\/tcbb.2018.2889102","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability - Second Edition, vol. 336 of Frontiers in Artificial Intelligence and Applications. IOS Press (2021). https:\/\/doi.org\/10.3233\/FAIA336","DOI":"10.3233\/FAIA336"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1007\/978-3-642-27660-6_50","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"L Bordeaux","year":"2012","unstructured":"Bordeaux, L., Marques-Silva, J.: Knowledge compilation with empowerment. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 612\u2013624. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27660-6_50"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"B\u00fcning, H.K., Bubeck, U.: Theory of quantified Boolean formulas. In: Handbook of Satisfiability (2021). https:\/\/doi.org\/10.3233\/978-1-58603-929-5-735","DOI":"10.3233\/978-1-58603-929-5-735"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Chevalier, S., Froidevaux, C., Paulev\u00e9, L., Zinovyev, A.: Synthesis of Boolean networks from biological dynamical constraints using answer-set programming. In: 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI), pp. 34\u201341. IEEE (2019). https:\/\/doi.org\/10.1109\/ICTAI.2019.00014","DOI":"10.1109\/ICTAI.2019.00014"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-030-60327-4_11","volume-title":"Computational Methods in Systems Biology","author":"S Chevalier","year":"2020","unstructured":"Chevalier, S., No\u00ebl, V., Calzone, L., Zinovyev, A., Paulev\u00e9, L.: Synthesis and simulation of ensembles of Boolean networks for cell fate decision. In: Abate, A., Petrov, T., Wolf, V. (eds.) CMSB 2020. LNCS, vol. 12314, pp. 193\u2013209. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60327-4_11"},{"key":"11_CR11","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2022.838546","volume":"8","author":"L Cifuentes-Fontanals","year":"2022","unstructured":"Cifuentes-Fontanals, L., Tonello, E., Siebert, H.: Control in Boolean networks with model checking. Front. Appl. Math. Statist. 8, 838546 (2022). https:\/\/doi.org\/10.3389\/fams.2022.838546","journal-title":"Front. Appl. Math. Statist."},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"E Clarke","year":"2003","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM (JACM) 50(5), 752\u2013794 (2003). https:\/\/doi.org\/10.1145\/876638.876643","journal-title":"J. ACM (JACM)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-016-1287-z","volume":"17","author":"J Dorier","year":"2016","unstructured":"Dorier, J., Crespo, I., Niknejad, A., Liechti, R., Ebeling, M., Xenarios, I.: Boolean regulatory network reconstruction using literature based knowledge with a genetic algorithm optimization method. BMC Bioinform. 17, 1\u201319 (2016). https:\/\/doi.org\/10.1186\/s12859-016-1287-z","journal-title":"BMC Bioinform."},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Drechsler, R., Becker, B.: Binary decision diagrams: theory and implementation. Springer Science & Business Media (2013). https:\/\/doi.org\/10.1007\/978-1-4757-2892-7","DOI":"10.1007\/978-1-4757-2892-7"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01561-8","volume":"6","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer set solving in practice. Synth. Lect. Artif. Intell. Mach. Learn. 6(3), 1\u2013238 (2012). https:\/\/doi.org\/10.1007\/978-3-031-01561-8","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/s1471068418000054","volume":"19","author":"M Gebser","year":"2018","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with Clingo. Theory Pract. Logic Program. 19(1), 27\u201382 (2018). https:\/\/doi.org\/10.1017\/s1471068418000054","journal-title":"Theory Pract. Logic Program."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-030-31304-3_15","volume-title":"Computational Methods in Systems Biology","author":"J Goldfeder","year":"2019","unstructured":"Goldfeder, J., Kugler, H.: BRE:IN - backend for reasoning about interaction networks with temporal logic. In: Bortolussi, L., Sanguinetti, G. (eds.) CMSB 2019. LNCS, vol. 11773, pp. 289\u2013295. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31304-3_15"},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1109\/TCBB.2018.2879097","volume":"17","author":"H Klarner","year":"2018","unstructured":"Klarner, H., Heinitz, F., Nee, S., Siebert, H.: Basins of attraction, commitment sets, and phenotypes of Boolean networks. IEEE\/ACM Trans. Comput. Biol. Bioinf. 17(4), 1115\u20131124 (2018). https:\/\/doi.org\/10.1109\/TCBB.2018.2879097","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"130","DOI":"10.3389\/fbioe.2015.00130","volume":"3","author":"H Klarner","year":"2015","unstructured":"Klarner, H., Siebert, H.: Approximating attractors of Boolean networks by iterative CTL model checking. Front. Bioeng. Biotechnol. 3, 130 (2015). https:\/\/doi.org\/10.3389\/fbioe.2015.00130","journal-title":"Front. Bioeng. Biotechnol."},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-63046-5_23","volume-title":"Automated Deduction \u2013 CADE 26","author":"F Lonsing","year":"2017","unstructured":"Lonsing, F., Egly, U.: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 371\u2013384. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_23"},{"key":"11_CR21","doi-asserted-by":"publisher","DOI":"10.7554\/eLife.72626","volume":"11","author":"A Montagud","year":"2022","unstructured":"Montagud, A., et al.: Patient-specific Boolean models of signalling networks guide personalised treatments. Elife 11, e72626 (2022). https:\/\/doi.org\/10.7554\/eLife.72626","journal-title":"Elife"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.ejor.2021.10.019","volume":"300","author":"K Moon","year":"2022","unstructured":"Moon, K., Lee, K., Chopra, S., Kwon, S.: Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy. Eur. J. Oper. Res. 300(2), 743\u2013754 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.10.019","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Moon, K., Lee, K., Paulev\u00e9, L.: Computational complexity of minimal trap spaces in Boolean networks. ArXiv e-prints (2022). https:\/\/doi.org\/10.48550\/arXiv.2212.12756","DOI":"10.48550\/arXiv.2212.12756"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Paulev\u00e9, L.: Marker and source-marker reprogramming of most permissive Boolean networks and ensembles with BoNesis. Peer Commun. J. 3, e30 (2023). https:\/\/doi.org\/10.24072\/pcjournal.255","DOI":"10.24072\/pcjournal.255"},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"4256","DOI":"10.1038\/s41467-020-18112-5","volume":"11","author":"L Paulev\u00e9","year":"2020","unstructured":"Paulev\u00e9, L., Kol\u010d\u00e1k, J., Chatain, T., Haar, S.: Reconciling qualitative, abstract, and scalable modeling of biological networks. Nat. Commun. 11(1), 4256 (2020). https:\/\/doi.org\/10.1038\/s41467-020-18112-5","journal-title":"Nat. Commun."},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Paulev\u00e9, L., Sen\u00e9, S.: Non-deterministic updates of Boolean networks. In: 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA: volume 90 of Open Access Series in Informatics (OASIcs), pp. 1\u201316. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik 2021 (2021). https:\/\/doi.org\/10.4230\/OASIcs.AUTOMATA.2021.10","DOI":"10.4230\/OASIcs.AUTOMATA.2021.10"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Paulev\u00e9, L., Sen\u00e9, S.: Boolean networks and their dynamics: the impact of updates. In: Systems Biology Modelling and Analysis: Formal Bioinformatics Methods and Tools. Wiley (2022). https:\/\/doi.org\/10.1002\/9781119716600.ch6","DOI":"10.1002\/9781119716600.ch6"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Rabe, M.N., Tentrup, L.: CAQE: a certifying QBF solver. In: 2015 Formal Methods in Computer-Aided Design (FMCAD), pp. 136\u2013143. IEEE (2015). https:\/\/doi.org\/10.1109\/FMCAD.2015.7542263","DOI":"10.1109\/FMCAD.2015.7542263"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"R\u00e9da, C., Delahaye-Duriez, A.: Prioritization of candidate genes through Boolean networks. In: Petre, I., Paun, A. (eds.) Computational Methods in Systems Biology. CMSB 2022. LNCS, vol. 13447, pp. 89\u2013121. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15034-0_5","DOI":"10.1007\/978-3-031-15034-0_5"},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Trinh, V.-G., Benhamou, B., Hiraishi, K., Soliman, S.: Minimal trap spaces of logical models are maximal siphons of their petri net encoding. In: Petre, I., Paun, A. (eds.) Computational Methods in Systems Biology. CMSB 2022. LNCS, vol. 13447, pp. 158\u2013176. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15034-0_8","DOI":"10.1007\/978-3-031-15034-0_8"},{"issue":"1","key":"11_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/npjsba.2016.10","volume":"2","author":"B Yordanov","year":"2016","unstructured":"Yordanov, B., Dunn, S.-J., Kugler, H., Smith, A., Martello, G., Emmott, S.: A method to identify and analyze biological programs through automated reasoning. NPJ Syst. Biol. Appl. 2(1), 1\u201316 (2016). https:\/\/doi.org\/10.1038\/npjsba.2016.10","journal-title":"NPJ Syst. Biol. Appl."},{"issue":"17","key":"11_CR32","doi-asserted-by":"publisher","first-page":"4603","DOI":"10.1158\/0008-5472.can-21-1208","volume":"81","author":"JGT Za\u00f1udo","year":"2021","unstructured":"Za\u00f1udo, J.G.T., et al.: Cell line-specific network models of ER+ breast cancer identify potential PI3ka inhibitor resistance mechanisms and drug combinations. Can. Res. 81(17), 4603\u20134617 (2021). https:\/\/doi.org\/10.1158\/0008-5472.can-21-1208","journal-title":"Can. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Methods in Systems Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42697-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T09:03:55Z","timestamp":1694163835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42697-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031426964","9783031426971"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42697-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMSB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Methods in Systems Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","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 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmsb2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cmsb2023.uni.lu\/","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":"28","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":"14","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":"50% - 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.72 (regular), 3 (tool)","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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}