Jürgen Giesl

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 34 Citations 5,203 142 World Ranking 8115 National Ranking 386

Overview

What are the main themes of his work throughout his whole career to date

Class (philosophy), Inductive reasoning, Dependency (UML) and Quantifier (linguistics) are all intertwined in Artificial intelligence research. His study in Artificial intelligence extends to Class (philosophy) with its themes. His research brings together the fields of Pure mathematics and Algebra over a field. His Pure mathematics study frequently involves adjacent topics like Algebra over a field. His research on Theoretical computer science often connects related areas such as Automated theorem proving. Automated theorem proving is closely attributed to Theoretical computer science in his research. As part of his studies on Programming language, Jürgen Giesl frequently links adjacent subjects like Confluence. Jürgen Giesl combines Confluence and Rewriting in his research. Rewriting is closely attributed to Equational logic in his research.

Jürgen Giesl most often published in these fields:

Artificial intelligence (100.00%)
Algebra over a field (66.67%)
Theoretical computer science (66.67%)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Termination of term rewriting using dependency pairs

Thomas Arts;Jürgen Giesl.
Theoretical Computer Science (2000)

753 Citations

AProVE 1.2: automatic termination proofs in the dependency pair framework

Jürgen Giesl;Peter Schneider-Kamp;René Thiemann.
international joint conference on automated reasoning (2006)

335 Citations

Mechanizing and Improving Dependency Pairs

Jürgen Giesl;René Thiemann;Peter Schneider-Kamp;Stephan Falke.
Journal of Automated Reasoning (2006)

258 Citations

Automated Termination Proofs with AProVE

Jürgen Giesl;René Thiemann;Peter Schneider-Kamp;Stephan Falke.
rewriting techniques and applications (2004)

205 Citations

The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

Jürgen Giesl;René Thiemann;Peter Schneider-Kamp.
international conference on logic programming (2005)

198 Citations

SAT solving for termination analysis with polynomial interpretations

Carsten Fuhs;Jürgen Giesl;Aart Middeldorp;Peter Schneider-Kamp.
theory and applications of satisfiability testing (2007)

174 Citations

Proving and disproving termination of higher-order functions

Jürgen Giesl;René Thiemann;Peter Schneider-Kamp.
frontiers of combining systems (2005)

156 Citations

Analyzing Program Termination and Complexity Automatically with AProVE

Jürgen Giesl;Cornelius Aschermann;Marc Brockschmidt;Fabian Emmes.
Journal of Automated Reasoning (2017)

133 Citations

Proving Termination of Programs Automatically with AProVE

Jürgen Giesl;Marc Brockschmidt;Fabian Emmes;Florian Frohn.
international joint conference on automated reasoning (2014)

109 Citations

Modular Termination Proofs for Rewriting Using Dependency Pairs

Jürgen Giesl;Thomas Arts;Enno Ohlebusch.
Journal of Symbolic Computation (2002)

109 Citations

If you think any of the details on this page are incorrect, let us know.

Jürgen Giesl

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Overview

What are the main themes of his work throughout his whole career to date

Jürgen Giesl most often published in these fields:

Best Publications

Report an issue

Frequent Co-Authors

External Links

Best Scientists Citing Jürgen Giesl

Trending Scientists