François Fages

François Fages (August 23, 1959) is a French computer scientist known for contributions in the areas of unification theory, rule-based modelling, logic programming, concurrent constraint logic programming, computational biology and systems biology.

Fages was born in Paris, France. He received his PhD from the Université Pierre et Marie Curie under the supervision of Gérard Huet, in 1983 at the age of 23.

Fages took a junior researcher position from CNRS at Ecole Normale Supérieure, and became in addition, part-time teacher at Ecole Polytechnique from 1985 to 1998, and part-time consultant at Thomson-CSF (now Thales Group) research center from 1985 to 1996. Since 1999, he is a senior researcher at the Institut national de recherche en informatique et en automatique (INRIA), the French national research institute on computer science and control.

He is known in unification theory for having shown the non-existence of minimal sets of unifiers in some equational theories (conjecture of Plotkin, 1972), and the decidability of associative-commutative unification in presence of several function symbols (conjecture of Stickel, 1981).

In rule-based modelling, he is known for having created in 1988 a reactive rule-based language at Thomson-CSF (now Thalès group), which was later industrialized by ILOG (now IBM-Ilog) and became ILOG-Rules in 1996.

Fages theorem states that in a logic program with negations, but without circuits through an odd number of negations, the stable models of the program coincide with the Herbrand models of its Clark's completion. This result has shown useful for implementing stable model semantics with classical propositional satisfiability solvers. In concurrent constraint logic programming, he has established with Paul Ruet and Sylvain Soliman the logical semantics of concurrent constraint programs in Jean-Yves Girard's linear logic. This result has been generalized to Constraint handling rules and to the asynchronous Pi-calculus.

In 2010 Fages co-ordinated a project to use mathematics to improve the packing of light bulbs and other oddly shaped products.

In 2014 Fages works in computational systems biology, coordinates the development of the Biochemical Abstract Machine (BIOCHAM) rule-based modeling and logical analysis software and studies biochemical processes in the cell cycle and in cell signaling.

In 2014, he received the Monpetit Prize from the French Academy of Sciences.

• Domitille Heitzler, Guillaume Durand, Nathalie Gallay, Aurélien Rizk, Seungkirl Ahn, Jihee Kim, Jonathan D. Violin, Laurence Dupuy, Christophe Gauthier, Vincent Piketty, Pascale Crépieux, Anne Poupon, Frédérique Clément, François Fages, Robert J. Lefkowitz, Eric Reiter (2012). "Competing G protein-coupled receptor kinases balance G protein and β-arrestin signaling". Molecular Systems Biology, 8(590).
• Calzone, Laurence; Fages, François; Soliman, Sylvain (2006). "BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge". Bioinformatics 22(14):1805-1807.
• Gilbert, David; Fuss, Hendrick; Gu, Xu; Orton, Richard; Robinson, Steve; Vyshemirsky, Vladislav; Kurth, Mary Jo; Downes, C. Stephen; Dubitzky, Werner (2006). "Computational methodologies for modelling, analysis and simulation of signalling networks". Briefings in Bioinformatics, 7(4):339-353.
• Fages, François; Ruet, Paul; Soliman, Sylvain (2001). "Linear concurrent constraint programming: operational and phase semantics". Information and Computation. 165 (1): 4–41. doi:10.1006/inco.2000.3002. 
• Fages, François (1994). "Consistency of Clark's Completion and Existence of Stable Models". Methods of Logic in Computer Science. 1: 51–60. 
• Fages, François (1987). "Associative-Commutative Unification". J. Symbolic Comput. 3 (3): 257–275. doi:10.1016/S0747-7171(87)80004-4. 
• Fages, François; Huet, Gérard (1986). "Complete Sets of Unifiers and Matchers in Equational Theories". Theoretical Computer Science. 43: 189–200. doi:10.1016/0304-3975(86)90175-1.