Calcul de La Distance Par Les Sous-Mots. - Jean-Jacques Hébrard; Maxime Crochemore (RAIRO Theor. Informatics Appl., 1986)

Strategies for Modal Resolution: Results and Problems. - Yves Auffray; Patrice Enjalbert; Jean-Jacques Hébrard (J. Autom. Reason., 1990)

An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences. - Jean-Jacques Hébrard (Theor. Comput. Sci., 1991)

A Linear Algorithm for Renaming a Set of Clauses as a Horn Set. - Jean-Jacques Hébrard (Theor. Comput. Sci., 1994)

Unique Horn Renaming an Unique 2-Satisfiability. - Jean-Jacques Hébrard (Inf. Process. Lett., 1995)

On Generating All Solutions of Generalized Satisfiability Problems. - Nadia Creignou; Jean-Jacques Hébrard (RAIRO Theor. Informatics Appl., 1997)

The Horn Basis of a Set of Clauses. - Jean-Jacques Hébrard; Philippe Luquet (J. Log. Program., 1998)

Prédiction de la biodégradabilité des composés chimiques : un apport des méthodes d'arbre de décision. - Bertrand Cuissart; Bruno Crémilleux; Jean-Jacques Hébrard; Frédérique Touffet (EGC, 2001)

A unified framework for structure identification. - Bruno Zanuttini; Jean-Jacques Hébrard (Inf. Process. Lett., 2002)

Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas. - Emmanuel Benoist; Jean-Jacques Hébrard (Ann. Math. Artif. Intell., 2003)

An efficient algorithm for Horn description. - Jean-Jacques Hébrard; Bruno Zanuttini (Inf. Process. Lett., 2003)

A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs. - Bertrand Cuissart; Jean-Jacques Hébrard (GbRPR, 2005)