基本信息
浏览量:95
职业迁徙
个人简介
My career has been marked by several thematic mobilities always rooted in computer science and
mathematical logic. I started my research in fundamental computer science on unification theory,
by solving a conjecture of Plotkin 1972 in my Master’s degree in 1981 [CAAP’83, TCS’86, 42+95 citations]
and a conjecture of Stickel 1975 in my PhD thesis in 1983 on associative-commutative unification
[CADE’84, JSC’87, thesis, 118+63+41 citations]. I got a CNRS research position at Ecole Normale
Sup´erieure (one of the two most prestigious schools in France) and was on leave for three years (followed
by 15 years as part-time consultant) at the Central Research Laboratory of the Thomson-CSF
(Thales) company, where I developed a rule-based language for reactive systems and a constraint
logic programming system for combinatorial optimization problems. The first system
was industrialized by ILOG and became in the 90’s its first product named ILOG-Rules. During that
period I also got a part time associate professorship position at Ecole Polytechnique (the other most
prestigious school in France) where I taught algorithmics and constraint logic programming (monograph:
F. Fages. Programmation Logique par Contraintes. Ed Ellipses. Collection Cours de l’Ecole
Polytechnique. 1996 ). Back to CNRS at ENS as main position, I worked on the semantics of negation
in rule-based languages with one main contribution known as “Fages’s theorem” [MLCS’94,
NGC’91, 309+77 citations] which is now widely used in the implementations of Answer Set Programming
(ASP) systems. I then moved to the study of concurrent constraint programs and showed with two PhD students their mathematical semantics in J.Y. Girard’s linear logic [LICS’98, IC’01,
26+71 citations]. In 1999, I joined Inria and created a research group along these lines of research
on constraint programming. However in 2001, I got interested in computational systems biology
and coordinated an Inria Research Action with V . Danos, V.Sch¨achter and A. Bockmayr on
this new interdisciplinary topic. I created a rule-based language called the Biochemical Abstract
Machine (BIOCHAM) [Bioinformatics’06, TCSB’06, JBPC’04, 189+97+145 citations] for modelling
large biochemical reaction networks and using symbolic model-checking techniques to reason
about them [CMSB’03, TCS’04, 142+201 citations]. Since then, most of my publications are in this
domain described in my ten years track record. In particular I developed temporal logic methods
as a logical paradigm for quantitative biology [CMSB’08, Bioinformatics’09, CMSB’07, TCS’08,
TCS’11, 67+66+37+25+25 citations], and obtained with these methods some significant results in
cell biology, e.g. for the elucidation of the complex dynamics of GPCR signaling, in a paper
with E. Reiter, INRA Nouzilly, and R. Lefkowitz, Nobel prize in Chemistry 2012, (D.Heitzler, . . . ,
F . Fages, R.J. Lefkowitz, E. Reiter. Competing G protein-coupled receptor kinases balance G protein
and β-arrestin signaling. Molecular Systems Biology, 8(590), 2012 ).
Academic honors and awards
2014 Laureate of the French Academy of Sciences, Michel Monpetit Prize (prestigious award in
Applied Mathematics and Computer Science delivered nearly every year since 1978).
2010- Inria Scientific Excellence Awards (award delivered globally to 15-20% of Inria researchers).
研究兴趣
论文共 261 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
THEORETICAL COMPUTER SCIENCE (2024): 114294-114294
THEORETICAL COMPUTER SCIENCE (2024)
CoRR (2024): 135-150
COMPUTATIONAL METHODS IN SYSTEMS BIOLOGY, CMSB 2023 (2023): 78-96
ICLR 2023 (2023)
arXiv (Cornell University) (2023)
HAL (Le Centre pour la Communication Scientifique Directe) (2022)
引用0浏览0引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn