Uwe Egly

1.1k total citations
24 papers, 245 citations indexed

About

Uwe Egly is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Uwe Egly has authored 24 papers receiving a total of 245 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Artificial Intelligence, 15 papers in Computational Theory and Mathematics and 3 papers in Computer Networks and Communications. Recurrent topics in Uwe Egly's work include Logic, Reasoning, and Knowledge (14 papers), Formal Methods in Verification (13 papers) and Logic, programming, and type systems (11 papers). Uwe Egly is often cited by papers focused on Logic, Reasoning, and Knowledge (14 papers), Formal Methods in Verification (13 papers) and Logic, programming, and type systems (11 papers). Uwe Egly collaborates with scholars based in Austria, Germany and United States. Uwe Egly's co-authors include Stefan Woltran, Sarah Alice Gaggl, Hans Tompits, Thomas Eiter, Martina Seidl, Carsten Sinz, Florian Lonsing, Stephan Schmitt, Nadia Creignou and Timo Räth and has published in prestigious journals such as Toxicologic Pathology, Lecture notes in computer science and Information and Computation.

In The Last Decade

Uwe Egly

21 papers receiving 220 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Uwe Egly Austria 8 209 103 28 19 11 24 245
Irène Guessarian France 7 155 0.7× 155 1.5× 29 1.0× 11 0.6× 9 0.8× 28 213
Ben Moszkowski United Kingdom 7 139 0.7× 120 1.2× 33 1.2× 17 0.9× 17 1.5× 24 167
Howard A. Blair United States 7 279 1.3× 169 1.6× 51 1.8× 15 0.8× 16 1.5× 26 313
Benjamin Aminof Italy 9 133 0.6× 132 1.3× 15 0.5× 31 1.6× 7 0.6× 27 175
Rajeev Goré Australia 9 266 1.3× 180 1.7× 19 0.7× 12 0.6× 13 1.2× 52 284
Paul Hoogendijk Netherlands 6 119 0.6× 104 1.0× 19 0.7× 20 1.1× 10 0.9× 10 144
Paulo A. S. Veloso Brazil 7 131 0.6× 88 0.9× 42 1.5× 15 0.8× 16 1.5× 51 166
Michał Walicki Norway 8 111 0.5× 77 0.7× 10 0.4× 9 0.5× 17 1.5× 35 145
Mihaela Sighireanu France 6 70 0.3× 93 0.9× 46 1.6× 48 2.5× 26 2.4× 18 158
Alban Ponse Netherlands 9 185 0.9× 202 2.0× 22 0.8× 21 1.1× 9 0.8× 46 243

Countries citing papers authored by Uwe Egly

Since Specialization
Citations

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

Fields of papers citing papers by Uwe Egly

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Uwe Egly

This figure shows the co-authorship network connecting the top 25 collaborators of Uwe Egly. A scholar is included among the top collaborators of Uwe Egly 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 Uwe Egly. Uwe Egly 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.
Bloem, Roderick, et al.. (2018). Expansion-Based QBF Solving Without Recursion. 1–10. 4 indexed citations
2.
Egly, Uwe, et al.. (2016). Conformant planning as a case study of incremental QBF solving. Annals of Mathematics and Artificial Intelligence. 80(1). 21–45. 18 indexed citations
3.
4.
Sinz, Carsten & Uwe Egly. (2014). Theory and Applications of Satisfiability Testing – SAT 2014. Lecture notes in computer science. 10 indexed citations
5.
Egly, Uwe & Leopold Haller. (2010). A SAT Solver for Circuits Based on the Tableau Method. KI - Künstliche Intelligenz. 24(1). 15–23.
6.
Egly, Uwe, Sarah Alice Gaggl, & Stefan Woltran. (2010). Answer-set programming encodings for argumentation frameworks. 1(2). 147–177. 73 indexed citations
7.
Egly, Uwe, Martina Seidl, & Stefan Woltran. (2008). A solver for QBFs in negation normal form. Constraints. 14(1). 38–79. 14 indexed citations
8.
Egly, Uwe & Stefan Woltran. (2006). Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. 133–144. 19 indexed citations
9.
Egly, Uwe, Martina Seidl, & Stefan Woltran. (2006). A Solver for QBFs in Nonprenex Form. European Conference on Artificial Intelligence. 477–481. 8 indexed citations
10.
Egly, Uwe, Hans Tompits, & Stefan Woltran. (2004). On Quantifier Shifting for Quantified Boolean Formulas. 4 indexed citations
11.
Egly, Uwe & Hans Tompits. (2003). On Different Proof-Search Strategies for Orthologic. Studia Logica. 73(1). 131–152. 3 indexed citations
12.
Egly, Uwe, et al.. (2001). Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Toxicologic Pathology. 39(5). 893–900. 4 indexed citations
13.
Egly, Uwe. (2001). On Different Intuitionistic Calculi and Embeddings from Int to S4. Studia Logica. 69(2). 249–277. 1 indexed citations
14.
Egly, Uwe & Hans Tompits. (2001). Proof-complexity results for nonmonotonic reasoning. ACM Transactions on Computational Logic. 2(3). 340–387. 6 indexed citations
15.
Egly, Uwe, Thomas Eiter, Hans Tompits, & Stefan Woltran. (2000). Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. National Conference on Artificial Intelligence. 417–422. 52 indexed citations
16.
Egly, Uwe & Timo Räth. (2000). Practically Useful Variants of Definitional Translations to Normal Form. Information and Computation. 162(1-2). 255–264. 1 indexed citations
17.
Egly, Uwe, et al.. (2000). Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP.. 113–122. 1 indexed citations
18.
Egly, Uwe & Stephan Schmitt. (1999). On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis. Fundamenta Informaticae. 39(1,2). 59–83. 6 indexed citations
19.
Egly, Uwe. (1996). On Different Structure-preserving Translations to Normal Form. Journal of Symbolic Computation. 22(2). 121–142. 8 indexed citations
20.
Bibel, Wolfgang, et al.. (1994). Towards an adequate theorem prover based on the connection method. International Conference on Artificial Intelligence. 137–148. 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 Irène Guessarian Breakdown of academic impact, for papers by Ben Moszkowski Breakdown of academic impact, for papers by Howard A. Blair Breakdown of academic impact, for papers by Benjamin Aminof Breakdown of academic impact, for papers by Rajeev Goré Breakdown of academic impact, for papers by Paul Hoogendijk Breakdown of academic impact, for papers by Paulo A. S. Veloso Breakdown of academic impact, for papers by Michał Walicki Breakdown of academic impact, for papers by Mihaela Sighireanu Breakdown of academic impact, for papers by Alban Ponse
Rankless by CCL
2026