Jean-Jacques Hébrard

12 papers Journal 10Unranked 2
YearRankTypeTitle / Venue / Authors
2005 — conf
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs.
GbRPR
Bertrand Cuissart, Jean-Jacques Hébrard
2003 J jnl
An efficient algorithm for Horn description.
Inf. Process. Lett.
Jean-Jacques Hébrard, Bruno Zanuttini
2003 J jnl
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas.
Ann. Math. Artif. Intell.
Emmanuel Benoist, Jean-Jacques Hébrard
2002 J jnl
A unified framework for structure identification.
Inf. Process. Lett.
Bruno Zanuttini, Jean-Jacques Hébrard
2001 — conf
Prédiction de la biodégradabilité des composés chimiques : un apport des méthodes d'arbre de décision.
EGC
Bertrand Cuissart, Bruno Crémilleux, Jean-Jacques Hébrard, Frédérique Touffet
1998 J jnl
The Horn Basis of a Set of Clauses.
J. Log. Program.
Jean-Jacques Hébrard, Philippe Luquet
1997 J jnl
On Generating All Solutions of Generalized Satisfiability Problems.
RAIRO Theor. Informatics Appl.
Nadia Creignou, Jean-Jacques Hébrard
1995 J jnl
Unique Horn Renaming an Unique 2-Satisfiability.
Inf. Process. Lett.
Jean-Jacques Hébrard
1994 J jnl
A Linear Algorithm for Renaming a Set of Clauses as a Horn Set.
Theor. Comput. Sci.
Jean-Jacques Hébrard
1991 J jnl
An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences.
Theor. Comput. Sci.
Jean-Jacques Hébrard
1990 J jnl
Strategies for Modal Resolution: Results and Problems.
J. Autom. Reason.
Yves Auffray, Patrice Enjalbert, Jean-Jacques Hébrard
1986 J jnl
Calcul de La Distance Par Les Sous-Mots.
RAIRO Theor. Informatics Appl.
Jean-Jacques Hébrard, Maxime Crochemore