Stéphane Kaplan
Impact in
-
- Formal Methods in Verification
- semigroups and automata theory
- Advanced Algebra and Logic
- Artificial Intelligence top 10%
- Logic, programming, and type systems
- Logic, Reasoning, and Knowledge
- Semantic Web and Ontologies
- Natural Language Processing Techniques
Papers in
-
- Logic, programming, and type systems 5
- Semantic Web and Ontologies 3
- Logic, Reasoning, and Knowledge 3
- Natural Language Processing Techniques 1
-
- Formal Methods in Verification 2
- Computability, Logic, AI Algorithms 1
- Co-authors
- David A. Plaisted (1 shared paper)Nachum Dershowitz (1 shared paper)Jean-Pierre Jouannaud (1 shared paper)Mitsuhiro Okada (1 shared paper)Christine Choppy (1 shared paper)
- Journals
- Theoretical Computer Science (4 papers)Journal of Symbolic Computation (1 paper)Bulletin of the European Association for Theoretical Computer Science (1 paper)Springer eBooks (1 paper)Medical Entomology and Zoology (1 paper)
- Partner nations
- FranceIsraelUnited States
In The Last Decade
Stéphane Kaplan
8 papers receiving 152 citations
Peers
Comparison fields: 5 of 15
- Computational Theory and Mathematics 117
- Artificial Intelligence 161
- Software 18
- Information Systems 14
- Hardware and Architecture 4
Countries citing papers authored by Stéphane Kaplan
This map shows the geographic impact of Stéphane Kaplan'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 Stéphane Kaplan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stéphane Kaplan more than expected).
Fields of papers citing papers by Stéphane Kaplan
This network shows the impact of papers produced by Stéphane Kaplan. 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 Stéphane Kaplan. The network helps show where Stéphane Kaplan may publish in the future.
Co-authors
The 5 scholars most cited alongside Stéphane Kaplan, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1984 | 66 | |
| 2 | 1991 | 46 | |
| 3 | 1987 | 37 | |
| 4 | Conditional Term Rewriting Systems: 1st International Workshop Orsay, France, July 8-10, 1987. Proceedings | 1988 | 8 |
| 5 | On the decidability of quasi-reducibility. | 1986 | 6 |
| 6 | 1988 | 4 | |
| 7 | 1991 | 3 | |
| 8 | 1989 | 1 | |
| 9 | 1989 | 0 |
About Stéphane Kaplan
Stéphane Kaplan is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Infectious Diseases and Organic Chemistry, having authored 9 papers that have together received 171 indexed citations. Recurring topics across this work include Logic, programming, and type systems (5 papers), Semantic Web and Ontologies (3 papers), Logic, Reasoning, and Knowledge (3 papers), Formal Methods in Verification (2 papers), Natural Language Processing Techniques (1 paper), Computability, Logic, AI Algorithms (1 paper), Distributed systems and fault tolerance (1 paper) and Advanced Database Systems and Queries (1 paper). The work is most often cited by research in Computational Theory and Mathematics (117 citations), Artificial Intelligence (161 citations), Software (18 citations), Information Systems (14 citations) and Hardware and Architecture (4 citations). Stéphane Kaplan has collaborated with scholars based in France, Israel and United States. Frequent co-authors include David A. Plaisted, Nachum Dershowitz, Jean-Pierre Jouannaud, Mitsuhiro Okada and Christine Choppy. Their work appears in journals such as Theoretical Computer Science, Journal of Symbolic Computation, Bulletin of the European Association for Theoretical Computer Science, Springer eBooks and Medical Entomology and Zoology.
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.