T. Chatain, S. Haar, J. Kol?ák, L. Paulevé, and A. Thakkar, Concurrency in Boolean networks, Natural Computing, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01893106

C. Terfve, T. Cokelaer, D. Henriques, A. Macnamara, E. Goncalves et al., CellNOptR: a flexible toolkit to train protein signaling networks to data using multiple logic formalisms, BMC Systems Biology, vol.6, issue.1, p.133, 2012.

J. Dorier, I. Crespo, A. Niknejad, R. Liechti, M. Ebeling et al., Boolean regulatory network reconstruction using literature based knowledge with a genetic algorithm optimization method, BMC Bioinformatics, vol.17, issue.1, p.410, 2016.

M. Ostrowski, L. Paulevé, T. Schaub, A. Siegel, and C. Guziolowski, Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming, Biosystems, vol.149, pp.139-153, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01354075

B. Yordanov, S. Dunn, H. Kugler, A. Smith, G. Martello et al., A method to identify and analyze biological programs through automated reasoning, Systems Biology and Applications, vol.2, 2016.

S. A. Kauffman, Metabolic stability and epigenesis in randomly connected nets, Journal of Theoretical Biology, vol.22, pp.437-467, 1969.

R. Thomas, Boolean formalization of genetic control circuits, Journal of Theoretical Biology, vol.42, issue.3, pp.563-585, 1973.

J. Aracena, E. Goles, A. Moreira, and L. Salinas, On the robustness of update schedules in Boolean networks, Biosystems, vol.97, issue.1, pp.1-8, 2009.

T. Chatain, S. Haar, and L. Paulevé, Boolean Networks: Beyond Generalized Asynchronicity, Cellular Automata and Discrete Complex Systems, ser. LNCS, vol.10875, pp.29-42, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01768359

T. Chatain, S. Haar, and L. Paulevé, Most Permissive Semantics of Boolean Networks, CoRR, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01864693

C. Baral, Knowledge Representation, Reasoning and Declarative Problem Solving, 2003.

M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub, Answer Set Solving in Practice, ser. Synthesis Lectures on Artificial Intelligence and Machine Learning, 2012.

F. Lin and Y. Zhao, ASSAT: Computing answer sets of a logic program by SAT solvers, Artificial Intelligence, vol.157, issue.1, pp.115-137, 2004.

D. Kleitman, On Dedekind's problem: The number of monotone Boolean functions, Proceedings of the American Mathematical Society, vol.21, issue.3, p.677, 1969.

D. Wiedemann, A computation of the eighth dedekind number, Order, vol.8, issue.1, pp.5-6, 1991.

X. Qiu, Q. Mao, Y. Tang, L. Wang, R. Chawla et al., Reversed graph embedding resolves complex single-cell trajectories, Nature Methods, vol.14, issue.10, pp.979-982, 2017.