| 2009 | ||
|---|---|---|
| 10 | Dominique Larchey-Wendling, Didier Galmiche: Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding. Mathematical Structures in Computer Science 19(3): 435-500 (2009) | |
| 2007 | ||
| 9 | Dominique Larchey-Wendling: Graph-based Decision for Gödel-Dummett Logics. J. Autom. Reasoning 38(1-3): 201-225 (2007) | |
| 2006 | ||
| 8 | Didier Galmiche, Dominique Larchey-Wendling: Expressivity Properties of Boolean. FSTTCS 2006: 357-368 | |
| 2005 | ||
| 7 | Dominique Larchey-Wendling: Bounding Resource Consumption with Gödel-Dummett Logics. LPAR 2005: 682-696 | |
| 2004 | ||
| 6 | Dominique Larchey-Wendling: Counter-Model Search in Gödel-Dummett Logics. IJCAR 2004: 274-288 | |
| 2002 | ||
| 5 | Dominique Larchey-Wendling: Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic. CADE 2002: 94-110 | |
| 2001 | ||
| 4 | Dominique Larchey-Wendling, Dominique Méry, Didier Galmiche: STRIP: Structural Sharing for Efficient Proof-Search. IJCAR 2001: 696-700 | |
| 2000 | ||
| 3 | Dominique Larchey-Wendling, Didier Galmiche: Quantales as completions of ordered monoids - Revised semantics for Intuitionistic Linear Logic. Electr. Notes Theor. Comput. Sci. 35: (2000) | |
| 1999 | ||
| 2 | Didier Galmiche, Dominique Larchey-Wendling: Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic. ASIAN 1999: 101-112 | |
| 1998 | ||
| 1 | Dominique Larchey-Wendling, Didier Galmiche: Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets. Electr. Notes Theor. Comput. Sci. 17: (1998) | |
| 1 | Didier Galmiche | [1] [2] [3] [4] [8] [10] |
| 2 | Dominique Méry | [4] |