Doktorant at Sorbonne University Forschungsgruppe : SPI
Forschungsleitung (Direction de recherche) : Thérèse HARDIN
Pas de titre
Verteidigung einer Doktorarbeit : 01.12.2006
Datum, an dem das LIP6 verlassen wurde : 01.09.2007
Publikationen 2004-2021
2021
A. Dey, B. Costé, É. Totel, A. Bécue, E. Aguas, A. Lambert, G. Blanc, H. Debar, Y. Chevalier, A. Medad, B. Gregorutti, E. Genetay, A. Nguema, G. Menguy, S. Bardin, R. Bonichon, C. De de Souza Lima, R. Charayron, Th. Lefèvre, N. Bartoli, J. Morlier, Z. Chihani, B. Carron, S. Brunessaux, L. Caquot, T. Charrier, B. El Bezzaz Semlali, O. Pasquero, A. Bazin, P.‑E. Flory, K. Kapusta, O. Stan, V. Thouvenot, K. Hynek, R. Ferrari, A. Boudguiga, R. Sirdey, A. Héliou, Th. Cejka, D. La Rocca, M. Zuber, G. Vardoulias, I. Papaioannou, A. Vekinis, G. Papadopoulou, M. Vincent, A. El Fallah‑Seghrouchni, V. Corruble, N. Bernardin, R. Kassab, F. Barbaresco, K. Tit, T. Furon, M. Rousset, L.‑M. Traonouez, P.‑Y. Lagrave, V. Vidal, M.‑C. Corbineau, T. Ceillier, A. IANCHERUK, Ah. Allali, J. Rodriguez, T. Bhor, R. Garcia, J.‑E. Guilhot‑Gaudeffroy, R. Plana : “Actes de la conférence CAID 2021 (Conference on Artificial Intelligence for Defense)”, CAID 2021 (Conference on Artificial Intelligence for Defense), pp. 1-152 (2021)
2007
R. Bonichon, D. Delahaye, D. Doligez : “Zenon: an Extensible Automated Theorem Prover Producing Checkable Proofs”, LPAR 2007 - 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol. 4790, Lecture Notes in Computer Science, Yerevan, Armenia, pp. 151-165, (Springer) (2007)
2006
R. Bonichon : “Pas de titre”, these, verteidigung einer doktorarbeit 01.12.2006, forschungsleitung (direction de recherche) Hardin, Thérèse (2006)
R. Bonichon, O. Hermant : “A Semantic Completeness Proof for TaMeD”, Logic for Programming, Artificial Intelligence, and Reasoning, (LPAR), vol. 4246, Lecture Notes in Computer Science, Phnom Penh, Cambodia, pp. 167-181, (Springer) (2006)
R. Bonichon, O. Hermant : “On Constructive Cut Admissibility in Deduction Modulo”, Types for Proofs and Programs, vol. 4502, Lecture Notes in Computer Science, Nottingham, United Kingdom, pp. 33-47, (Springer) (2006)
2004
R. Bonichon : “TaMeD: A Tableau Method for Deduction Modulo”, IJCAR 2004 - 2nd International Joint Conference on Automated Reasoning, vol. 3097, Lecture Notes in Computer Science, Cork, Ireland, pp. 445-459, (Springer) (2004)