Pierre Deransart
- Artificial Intelligence top 5%
- Computational Theory and Mathematics top 5%
- Software top 5%
- Information Systems top 10%
- Computer Networks and Communications top 10%
- Co-authors
- Jan MałuszyńskiMartin JourdanManuel V. HermenegildoBruno CourcelleFrancisco BuenoGermán PueblaWłodzimierz DrabentMireille Ducassé
- Topics
- Logic, programming, and type systems (16 papers)Logic, Reasoning, and Knowledge (13 papers)Formal Methods in Verification (8 papers)
In The Last Decade
Pierre Deransart
31 papers receiving 333 citations
Peers
Comparison fields: 5 of 30
- Artificial Intelligence 308
- Computational Theory and Mathematics 193
- Software 106
- Information Systems 86
- Computer Networks and Communications 72
Countries citing papers authored by Pierre Deransart
This map shows the geographic impact of Pierre Deransart'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 Pierre Deransart with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pierre Deransart more than expected).
Fields of papers citing papers by Pierre Deransart
This network shows the impact of papers produced by Pierre Deransart. 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 Pierre Deransart. The network helps show where Pierre Deransart may publish in the future.
Co-authorship network of co-authors of Pierre Deransart
This figure shows the co-authorship network connecting the top 25 collaborators of Pierre Deransart. A scholar is included among the top collaborators of Pierre Deransart 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 Pierre Deransart. Pierre Deransart is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Prolog: The Standard : Reference Manual | 8 |
| 2 | Subject Reduction of Logic Programs as Proof-Theoretic Property. | 1 |
| 3 | 1 | |
| 4 | Towards Soft Typing for CLP | 1 |
| 5 | CP Debugging Needs and Tools | 3 |
| 6 | On the role of semantic approximations in validation and diagnosis of constraint logic programs | 23 |
| 7 | Towards a Proof method of Non-Suspension of Concurrent Constraint Logic Programs. | 1 |
| 8 | 1 | |
| 9 | 21 | |
| 10 | 20 | |
| 11 | 5 | |
| 12 | NSTO Programs (Not Subject to Occur-Check). | 7 |
| 13 | What kind of grammars are logic programs | 3 |
| 14 | Attribute grammars and their applications : international conference WAGA, Paris, France, September 19-21, 1990 : proceedings | 1 |
| 15 | A methodological view of logic programming with negation | 4 |
| 16 | 0 | |
| 17 | Attribute Grammars: Definitions, Systems and Bibliography | 69 |
| 18 | 6 | |
| 19 | 55 | |
| 20 | Logical Attribute Grammars. | 5 |
About Pierre Deransart
Pierre Deransart is a scholar working on Software, Artificial Intelligence and Computational Theory and Mathematics, having authored 34 papers that have together received 385 indexed citations. Recurring topics across this work include Logic, programming, and type systems (16 papers), Logic, Reasoning, and Knowledge (13 papers) and Formal Methods in Verification (8 papers). The work is most often cited by research in Software (106 citations), Computational Theory and Mathematics (193 citations) and Artificial Intelligence (308 citations). Pierre Deransart has collaborated with scholars based in France, Sweden and Spain. Frequent co-authors include Jan Małuszyński, Martin Jourdan, Manuel V. Hermenegildo, Bruno Courcelle, Francisco Bueno, Germán Puebla, Włodzimierz Drabent, Mireille Ducassé, John W. Lloyd and Abderrahmane Aggoun. Their work appears in journals such as Theoretical Computer Science, Lecture notes in computer science and The Computer Journal.
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.