Didier Galmiche

1.2k total citations
41 papers, 250 citations indexed

About

Didier Galmiche is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Didier Galmiche has authored 41 papers receiving a total of 250 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Artificial Intelligence, 30 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in Didier Galmiche's work include Logic, Reasoning, and Knowledge (34 papers), Logic, programming, and type systems (30 papers) and Formal Methods in Verification (24 papers). Didier Galmiche is often cited by papers focused on Logic, Reasoning, and Knowledge (34 papers), Logic, programming, and type systems (30 papers) and Formal Methods in Verification (24 papers). Didier Galmiche collaborates with scholars based in France, Canada and United Kingdom. Didier Galmiche's co-authors include David Pym, Dominique Méry, Guy Perrier, Domingo Mery, Yakoub Salhi, Bruno Martin, Maurizio Martelli, Hans van Ditmarsch, Stéphane Demri and Giorgio Delzanno and has published in prestigious journals such as Theoretical Computer Science, Lecture notes in computer science and Information and Computation.

In The Last Decade

Didier Galmiche

38 papers receiving 238 citations

Peers

Didier Galmiche
Sophie Tison France
Carroll Morgan Australia
Temur Kutsia Austria
Rajeev Goré Australia
Christian G. Fermüller Austria
Witold Charatonik Poland
Claudio Sacerdoti Coen Italy
Mario Rodríguez-Artalejo Spain
Reinhold Letz Germany
Peter Baumgartner Germany
Sophie Tison France
Didier Galmiche
Citations per year, relative to Didier Galmiche Didier Galmiche (= 1×) peers Sophie Tison

Countries citing papers authored by Didier Galmiche

Since Specialization
Citations

This map shows the geographic impact of Didier Galmiche's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Didier Galmiche with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Didier Galmiche more than expected).

Fields of papers citing papers by Didier Galmiche

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Didier Galmiche. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Didier Galmiche. The network helps show where Didier Galmiche may publish in the future.

Co-authorship network of co-authors of Didier Galmiche

This figure shows the co-authorship network connecting the top 25 collaborators of Didier Galmiche. A scholar is included among the top collaborators of Didier Galmiche based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Didier Galmiche. Didier Galmiche is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Galmiche, Didier, et al.. (2021). Labelled cyclic proofs for separation logic. Journal of Logic and Computation. 31(3). 892–922. 1 indexed citations
2.
Galmiche, Didier, et al.. (2019). A Substructural Epistemic Resource Logic: Theory and Modelling\n Applications. arXiv (Cornell University). 1 indexed citations
3.
Ditmarsch, Hans van, et al.. (2019). A public announcement separation logic. Mathematical Structures in Computer Science. 29(6). 828–871. 3 indexed citations
4.
Ciabattoni, Agata, et al.. (2013). Hypersequent and labelled calculi for intermediate logics. Lecture notes in computer science. 8123. 1 indexed citations
5.
Galmiche, Didier, et al.. (2013). Nondeterministic Phase Semantics and the Undecidability of Boolean BI. ACM Transactions on Computational Logic. 14(1). 1–41. 8 indexed citations
6.
Galmiche, Didier & Yakoub Salhi. (2011). Sequent calculi and decidability for intuitionistic hybrid logic. Information and Computation. 209(12). 1447–1463. 4 indexed citations
7.
Galmiche, Didier & Yakoub Salhi. (2010). A family of Gödel hybrid logics. Journal of Applied Logic. 8(4). 371–385. 2 indexed citations
8.
Galmiche, Didier, et al.. (2009). Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding. Mathematical Structures in Computer Science. 19(3). 435–500. 14 indexed citations
9.
Galmiche, Didier, Dominique Méry, & David Pym. (2005). The semantics of BI and resource tableaux. Mathematical Structures in Computer Science. 15(6). 1033–1088. 55 indexed citations
10.
Galmiche, Didier, et al.. (2002). Resource Tableaux (extended abstract). Lecture notes in computer science. 2471. 183–199. 6 indexed citations
11.
Galmiche, Didier, et al.. (2001). Proof-search and countermodel generation in propositional BI Logic - extended abstract -. HAL (Le Centre pour la Communication Scientifique Directe). 2215. 263–282. 3 indexed citations
12.
Galmiche, Didier & David Pym. (2000). Proof-search in type-theoretic languages: an introduction. Theoretical Computer Science. 232(1-2). 5–53. 3 indexed citations
13.
Galmiche, Didier. (2000). Connection methods in linear logic and proof nets construction. Theoretical Computer Science. 232(1-2). 231–272. 10 indexed citations
14.
Galmiche, Didier, et al.. (1999). From Ordered Monoids to Quantales and Petri Nets: Revised Semantics and Completeness Results in Intuitionistic Linear Logic. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
15.
Galmiche, Didier. (1998). Connection proof search methods in Linear Logic and proof nets construction. Theoretical Computer Science. 2 indexed citations
16.
Galmiche, Didier, et al.. (1998). Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets. Electronic Notes in Theoretical Computer Science. 17. 1–18. 4 indexed citations
17.
Galmiche, Didier. (1997). Automated Reasoning with Analytic Tableaux and Related Methods. Lecture notes in computer science. 1 indexed citations
18.
Galmiche, Didier. (1994). Canonical Proofs for Linear Logic Programming Frameworks.. International Conference on Lightning Protection. 2 indexed citations
19.
Galmiche, Didier & Guy Perrier. (1994). On proof normalization in linear logic. Theoretical Computer Science. 135(1). 67–110. 26 indexed citations
20.
Galmiche, Didier. (1990). Constructive system for automatic program synthesis. Theoretical Computer Science. 71(2). 227–239. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Sophie Tison Breakdown of academic impact, for papers by Carroll Morgan Breakdown of academic impact, for papers by Temur Kutsia Breakdown of academic impact, for papers by Rajeev Goré Breakdown of academic impact, for papers by Christian G. Fermüller Breakdown of academic impact, for papers by Witold Charatonik Breakdown of academic impact, for papers by Claudio Sacerdoti Coen Breakdown of academic impact, for papers by Mario Rodríguez-Artalejo Breakdown of academic impact, for papers by Reinhold Letz Breakdown of academic impact, for papers by Peter Baumgartner
Rankless by CCL
2026