|
Search the dblp DataBase
Jean-Jacques Hébrard:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Bertrand Cuissart, Bruno Crémilleux, Jean-Jacques Hébrard, Frédérique Touffet
Prédiction de la biodégradabilité des composés chimiques : un apport des méthodes d'arbre de décision. [Citation Graph (0, 0)][DBLP] EGC, 2001, pp:351- [Conf]
- Bertrand Cuissart, Jean-Jacques Hébrard
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs. [Citation Graph (0, 0)][DBLP] GbRPR, 2005, pp:162-171 [Conf]
- Emmanuel Benoist, Jean-Jacques Hébrard
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2003, v:37, n:3, pp:251-272 [Journal]
- Jean-Jacques Hébrard
Unique Horn Renaming an Unique 2-Satisfiability. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:54, n:4, pp:235-239 [Journal]
- Jean-Jacques Hébrard, Bruno Zanuttini
An efficient algorithm for Horn description. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:177-182 [Journal]
- Bruno Zanuttini, Jean-Jacques Hébrard
A unified framework for structure identification. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:6, pp:335-339 [Journal]
- Nadia Creignou, Jean-Jacques Hébrard
On Generating All Solutions of Generalized Satisfiability Problems. [Citation Graph (0, 0)][DBLP] ITA, 1997, v:31, n:6, pp:499-511 [Journal]
- Jean-Jacques Hébrard, Maxime Crochemore
Calcul de La Distance Par Les Sous-Mots. [Citation Graph (0, 0)][DBLP] ITA, 1986, v:20, n:4, pp:441-456 [Journal]
- Yves Auffray, Patrice Enjalbert, Jean-Jacques Hébrard
Strategies for Modal Resolution: Results and Problems. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 1990, v:6, n:1, pp:1-38 [Journal]
- Jean-Jacques Hébrard, Philippe Luquet
The Horn Basis of a Set of Clauses. [Citation Graph (0, 0)][DBLP] J. Log. Program., 1998, v:34, n:1, pp:59-66 [Journal]
- Jean-Jacques Hébrard
An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1991, v:82, n:1, pp:35-49 [Journal]
- Jean-Jacques Hébrard
A Linear Algorithm for Renaming a Set of Clauses as a Horn Set. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:124, n:2, pp:343-350 [Journal]
Search in 0.001secs, Finished in 0.002secs
|