Danny De Schreye

2.2k total citations
75 papers, 806 citations indexed

About

Danny De Schreye is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Danny De Schreye has authored 75 papers receiving a total of 806 indexed citations (citations by other indexed papers that have themselves been cited), including 59 papers in Artificial Intelligence, 42 papers in Computational Theory and Mathematics and 6 papers in Information Systems. Recurrent topics in Danny De Schreye's work include Logic, programming, and type systems (47 papers), Logic, Reasoning, and Knowledge (37 papers) and Formal Methods in Verification (34 papers). Danny De Schreye is often cited by papers focused on Logic, programming, and type systems (47 papers), Logic, Reasoning, and Knowledge (37 papers) and Formal Methods in Verification (34 papers). Danny De Schreye collaborates with scholars based in Belgium, Denmark and Germany. Danny De Schreye's co-authors include Marc Denecker, Bern Martens, Michaël Leuschel, Maurice Bruynooghe, Sofie Verbaeten, Jesper Jørgensen, Morten Heine Sørensen, Robert Glück, Konstantinos Sagonas and Alexander Serebrenik and has published in prestigious journals such as ACM Computing Surveys, Artificial Intelligence and Future Generation Computer Systems.

In The Last Decade

Danny De Schreye

73 papers receiving 707 citations

Peers

Danny De Schreye
Danny De Schreye
Citations per year, relative to Danny De Schreye Danny De Schreye (= 1×) peers Pierre Castéran

Countries citing papers authored by Danny De Schreye

Since Specialization
Citations

This map shows the geographic impact of Danny De Schreye'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 Danny De Schreye with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Danny De Schreye more than expected).

Fields of papers citing papers by Danny De Schreye

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Danny De Schreye. 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 Danny De Schreye. The network helps show where Danny De Schreye may publish in the future.

Co-authorship network of co-authors of Danny De Schreye

This figure shows the co-authorship network connecting the top 25 collaborators of Danny De Schreye. A scholar is included among the top collaborators of Danny De Schreye 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 Danny De Schreye. Danny De Schreye 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.
Schreye, Danny De, Maurice Bruynooghe, Bart Demoen, et al.. (2000). Project report on LP + : a second generation logic programming language. AI Communications. 13(1). 13–18. 1 indexed citations
2.
Verbaeten, Sofie, Marc Denecker, & Danny De Schreye. (2000). Compositionality of normal open logic programs. The Journal of Logic Programming. 42(3). 151–183. 5 indexed citations
3.
Vanhoof, Wim, Danny De Schreye, & Bern Martens. (1999). Bottom-up partial deduction of logic programs. Lirias (KU Leuven). 1999. 1–33. 1 indexed citations
4.
Schreye, Danny De, Robert Glück, Jesper Jørgensen, et al.. (1999). Conjunctive partial deduction: foundations, control, algorithms, and experiments. The Journal of Logic Programming. 41(2-3). 231–277. 37 indexed citations
5.
Denecker, Marc & Danny De Schreye. (1998). SLDNFA: An abductive procedure for abductive logic programs. The Journal of Logic Programming. 34(2). 111–167. 56 indexed citations
6.
Vanhoof, Wim, et al.. (1998). Specialising the other way around. Lirias (KU Leuven). 279–293. 1 indexed citations
7.
Denecker, Marc, et al.. (1997). On the relation between situation calculus and event calculus. The Journal of Logic Programming. 31(1-3). 3–37. 16 indexed citations
8.
Denecker, Marc, et al.. (1996). A realistic experiment in knowledge representation in open event calculus: protocol specification. Lirias (KU Leuven). 170–184. 5 indexed citations
9.
Leuschel, Michaël, et al.. (1996). A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. Lirias (KU Leuven). 319–332. 32 indexed citations
10.
Martens, Bern & Danny De Schreye. (1995). Two semantics for definite meta-programs, using the non-ground representation. MIT Press eBooks. 57–81. 6 indexed citations
11.
Martens, Bern & Danny De Schreye. (1995). Why untyped nonground metaprogramming is not (much of) a problem. The Journal of Logic Programming. 22(1). 47–99. 9 indexed citations
12.
Schreye, Danny De, et al.. (1994). Termination of logic programs: the never-ending story. The Journal of Logic Programming. 19-20. 199–260. 83 indexed citations
13.
Martens, Bern, et al.. (1994). Sound and complete partial deduction with unfolding based on well-founded measures. Theoretical Computer Science. 122(1-2). 97–117. 5 indexed citations
14.
Schreye, Danny De, et al.. (1993). Automatic inference of norms: a missing link in automatic termination analysis. International Conference on Logic Programming. 420–436. 19 indexed citations
15.
Denecker, Marc & Danny De Schreye. (1992). On the duality of abduction and model generation. Future Generation Computer Systems. 650–657. 15 indexed citations
16.
Schreye, Danny De, et al.. (1990). Generation and compilation of efficient computation rules. International Conference on Lightning Protection. 700–714. 3 indexed citations
17.
Schreye, Danny De, et al.. (1990). A practical technique for detecting non-terminating queries for a restricted class of Horn clauses, using directed, weighted graphs. Lirias (KU Leuven). 649–663. 7 indexed citations
18.
Bruynooghe, Maurice, Luc De Raedt, & Danny De Schreye. (1989). Explanation based program transformation. Lirias (KU Leuven). 407–412. 6 indexed citations
19.
Schreye, Danny De & Maurice Bruynooghe. (1989). On the transformation of logic programs with instantiation based computation rules. Journal of Symbolic Computation. 7(2). 125–154. 4 indexed citations
20.
Schreye, Danny De & Maurice Bruynooghe. (1988). The compilation of forward checking regimes through meta-interpretation and transformation. Lirias (KU Leuven). 217–231. 3 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

Rankless by CCL
2026