Edit Profile (opens in new tab) Middeldorp, Aart Compute Distance To: Compute Author ID: middeldorp.aart Published as: Middeldorp, Aart; Middeldorp, A. External Links: MGP Documents Indexed: 111 Publications since 1988 10 Contributions as Editor Co-Authors: 56 Co-Authors with 112 Joint Publications 587 Co-Co-Authors all top 5 Co-Authors 9 single-authored 24 Zankl, Harald 22 Hirokawa, Nao 14 Winkler, Sarah 9 Felgenhauer, Bertram 7 Neurauter, Friedrich 7 Zantema, Hans 6 Giesl, Jürgen 6 Sternagel, Christian 5 Nagele, Julian 5 Ohsaki, Hitoshi 4 Korp, Martin 4 Suzuki, Taro 3 Durand, Irène A. 3 Geser, Alfons 3 Klop, Jan Willem 3 Kurihara, Masahito 3 Ohlebusch, Enno 3 Sato, Haruhiko 3 Sternagel, Thomas 3 Thiemann, René 2 Antoy, Sergio 2 de Vrijer, Roel 2 Felty, Amy P. 2 Fuhs, Carsten 2 Hamada, Mohamed 2 Ida, Tetsuo 2 Kohl, Christina 2 Kop, Cynthia 2 Lochmann, Alexander 2 Moser, Georg 2 Okui, Satoshi 2 Rapp, Franziska 2 Sato, Taisuke 2 Schneider-Kamp, Peter 2 Toyama, Yoshihito 2 van Oostrom, Vincent 2 van Raamsdonk, Femke 2 Yamada, Akihisa 1 Aoto, Takahito 1 Avenhaus, Jürgen 1 Ferreira, Maria C. F. 1 Fujita, Ken-etsu 1 Gramlich, Bernhard 1 Hamana, Makoto 1 Hamoen, Erik 1 Hanus, Michael 1 Hofbauer, Dieter 1 Koprowski, Adam 1 Loría-Sáenz, C. 1 Lucas, Salvador 1 McMillan, Kenneth L. 1 Mitterwallner, Fabian 1 Nishida, Naoki 1 Shintani, Kiraku 1 Voronkov, Andrei 1 Waldmann, Johannes all top 5 Serials 8 Information and Computation 6 Journal of Automated Reasoning 5 Journal of Symbolic Computation 5 Lecture Notes in Computer Science 4 Theoretical Computer Science 3 RIMS Kokyuroku 3 Logical Methods in Computer Science 2 Information Processing Letters 2 Applicable Algebra in Engineering, Communication and Computing 2 The Journal of Functional and Logic Programming 1 Acta Informatica 1 Bulletin of the Section of Logic 1 CWI Quarterly 1 Journal of Functional Programming 1 Annals of Mathematics and Artificial Intelligence 1 Theory and Practice of Logic Programming 1 ACM Transactions on Computational Logic 1 Electronic Notes in Theoretical Computer Science 1 Electronic Proceedings in Theoretical Computer Science (EPTCS) all top 5 Fields 121 Computer science (68-XX) 16 Mathematical logic and foundations (03-XX) 10 General and overarching topics; collections (00-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 General algebraic systems (08-XX) 1 Operations research, mathematical programming (90-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 91 Publications have been cited 518 times in 266 Documents Cited by ▼ Year ▼ Tyrolean termination tool: techniques and features. Zbl 1111.68048Hirokawa, Nao; Middeldorp, Aart 28 2007 Automating the dependency pair method. Zbl 1081.68038Hirokawa, Nao; Middeldorp, Aart 26 2005 SAT solving for termination analysis with polynomial interpretations. Zbl 1214.68352Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald 24 2007 Completeness results for basic narrowing. Zbl 0810.68088Middeldorp, Aart; Hamoen, Erik 23 1994 Modular properties of conditional term rewriting systems. Zbl 0804.68071Middeldorp, Aart 22 1993 Dependency pairs revisited. Zbl 1187.68275Hirokawa, Nao; Middeldorp, Aart 19 2004 Transformation techniques for context-sensitive rewrite systems. Zbl 1104.68056Giesl, Jürgen; Middeldorp, Aart 18 2004 Sequentiality in orthogonal term rewriting systems. Zbl 0746.68047Klop, Jan Willem; Middeldorp, Aart 16 1991 Approximating dependency graphs using tree automata techniques. Zbl 0988.68162Middeldorp, Aart 14 2001 Satisfiability of non-linear (ir)rational arithmetic. Zbl 1310.68126Zankl, Harald; Middeldorp, Aart 12 2010 Tyrolean termination tool. Zbl 1078.68656Hirokawa, Nao; Middeldorp, Aart 12 2005 Completeness of combinations of constructor systems. Zbl 0778.68050Middeldorp, Aart; Toyama, Yoshihito 12 1993 Lazy narrowing: Strong completeness and eager variable elimination. Zbl 0874.68157Middeldorp, Aart; Okui, Satoshi; Ida, Tetsuo 11 1996 CSI – a confluence tool. Zbl 1341.68199Zankl, Harald; Felgenhauer, Bertram; Middeldorp, Aart 10 2011 Maximal termination. Zbl 1145.68446Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald 10 2008 Polynomial interpretations with negative coefficients. Zbl 1109.68501Hirokawa, Nao; Middeldorp, Aart 10 2004 Simple termination is difficult. Zbl 0815.68064Middeldorp, Aart; Gramlich, Bernhard 10 1995 Simple termination of rewrite systems. Zbl 0903.68106Middeldorp, Aart; Zantema, Hans 9 1997 Strongly sequential and inductively sequential term rewriting systems. Zbl 1339.68136Hanus, Michael; Lucas, Salvador; Middeldorp, Aart 8 1998 Approximations for strategies and termination. Zbl 1270.68132Middeldorp, Aart 8 2002 KBO orientability. Zbl 1184.68303Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart 8 2009 Decreasing diagrams and relative termination. Zbl 1243.68199Hirokawa, Nao; Middeldorp, Aart 8 2011 A sufficient condition for the termination of the direct sum of term rewriting systems. Zbl 0716.68054Middeldorp, Aart 7 1989 Revisiting matrix interpretations for polynomial derivational complexity of term rewriting. Zbl 1306.68083Neurauter, Friedrich; Zankl, Harald; Middeldorp, Aart 7 2010 Uncurrying for termination. Zbl 1182.68094Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald 7 2008 Decidable call-by-need computations in term rewriting. Zbl 1101.68628Durand, Iréne; Middeldorp, Aart 6 2005 Joint spectral radius theory for automated complexity analysis of rewrite systems. Zbl 1307.68042Middeldorp, Aart; Moser, Georg; Neurauter, Friedrich; Waldmann, Johannes; Zankl, Harald 6 2011 A deterministic lazy narrowing calculus. Zbl 0983.68090Middeldorp, Aart; Okui, Satoshi 6 1998 Conditional confluence (system description). Zbl 1416.68181Sternagel, Thomas; Middeldorp, Aart 6 2014 Relative undecidability in term rewriting. II: The confluence hierarchy. Zbl 1012.68097Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans 6 2002 Transforming termination by self-labelling. Zbl 0939.68684Ferreira, Maria C. F.; Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans 6 1995 Modularity of confluence: A simplified proof. Zbl 0795.68111Klop, Jan Willem; Middeldorp, Aart; Toyama, Yoshihito; de Vrijer, Roel 6 1994 Labelings for decreasing diagrams. Zbl 1236.68157Zankl, Harald; Felgenhauer, Bertram; Middeldorp, Aart 5 2011 Automating the dependency pair method. Zbl 1278.68264Hirokawa, Nao; Middeldorp, Aart 5 2003 A sequential reduction strategy. Zbl 0872.68080Antoy, Sergio; Middeldorp, Aart 5 1996 Automating the first-order theory of rewriting for left-linear right-ground rewrite systems. Zbl 1387.68149Rapp, Franziska; Middeldorp, Aart 5 2016 Innermost termination of context-sensitive rewriting. Zbl 1015.68106Giesl, Jürgen; Middeldorp, Aart 5 2003 Transforming termination by self-labelling. Zbl 1412.68112Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans 5 1996 Uncurrying for termination and complexity. Zbl 1286.68262Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald 4 2013 Proving termination of rewrite systems using bounds. Zbl 1203.68077Korp, Martin; Middeldorp, Aart 4 2007 Predictive labeling with dependency pairs using SAT. Zbl 1213.68349Koprowski, Adam; Middeldorp, Aart 4 2007 Relative undecidability in term rewriting. I: The termination hierarchy. Zbl 1012.68096Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans 4 2002 Logicality of conditional rewrite systems. Zbl 0938.68050Yamada, T.; Avenhaus, J.; Loría-Sáenz, C.; Middeldorp, A. 4 2000 Termination tools in ordered completion. Zbl 1291.68376Winkler, Sarah; Middeldorp, Aart 3 2010 Match-bounds revisited. Zbl 1192.68399Korp, Martin; Middeldorp, Aart 3 2009 Satisfying KBO constraints. Zbl 1203.68080Zankl, Harald; Middeldorp, Aart 3 2007 Constraints for argument filterings. Zbl 1131.68468Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart 3 2007 Revisiting matrix interpretations for proving termination of term rewriting. Zbl 1236.68141Neurauter, Friedrich; Middeldorp, Aart 3 2011 Optimizing \(\text{mkb}_{\text{TT}}\). Zbl 1236.68156Winkler, Sarah; Sato, Haruhiko; Middeldorp, Aart; Kurihara, Masahito 3 2010 Root-labeling. Zbl 1145.68453Sternagel, Christian; Middeldorp, Aart 3 2008 Predictive labeling. Zbl 1151.68446Hirokawa, Nao; Middeldorp, Aart 3 2006 Relative undecidability in term rewriting. Zbl 0884.68067Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans 3 1997 Level-confluence of conditional rewrite systems with extra variables in right-hand sides. Zbl 0939.68679Suzuki, Taro; Middeldorp, Aart; Ida, Tetsuo 3 1995 Processes, terms and cycles: steps on the road to infinity. Essays dedicated to Jan Willem Klop on the occasion of his 60th birthday. Zbl 1097.68007 3 2005 Multi-completion with termination tools. (System description). Zbl 1165.68472Sato, Haruhiko; Winkler, Sarah; Kurihara, Masahito; Middeldorp, Aart 3 2008 Tsukuba termination tool. Zbl 1038.68561Hirokawa, Nao; Middeldorp, Aart 3 2003 Layer systems for proving confluence. Zbl 1246.68136Felgenhauer, Bertram; Zankl, Harald; Middeldorp, Aart 3 2011 Increasing interpretations. Zbl 1166.68381Zankl, Harald; Middeldorp, Aart 2 2008 Type introduction for equational rewriting. Zbl 0957.68050Middeldorp, Aart; Ohsaki, Hitoshi 2 2000 Completeness of combinations of conditional constructor systems. Zbl 0942.68592Middeldorp, Aart 2 1994 Improving automatic confluence analysis of rewrite systems by redundant rules. Zbl 1366.68125Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart 2 2015 CSI: new evidence - a progress report. Zbl 06778416Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart 2 2017 Beyond polynomials and Peano arithmetic – automation of elementary and ordinal interpretations. Zbl 1315.68168Zankl, Harald; Winkler, Sarah; Middeldorp, Aart 2 2015 Equational termination by semantic labelling. Zbl 0973.68094Ohsaki, Hitoshi; Middeldorp, Aart; Giesl, Jürgen 2 2000 On the modularity of deciding call-by-need. Zbl 0978.68071Durand, Irène; Middeldorp, Aart 2 2001 Certification of classical confluence results for left-linear term rewrite systems. Zbl 1478.68117Nagele, Julian; Middeldorp, Aart 2 2016 Infinite runs in abstract completion. Zbl 1441.68113Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian; Winkler, Sarah 2 2017 Match-bounds with dependency pairs for proving termination of rewrite systems. Zbl 1156.68430Korp, Martin; Middeldorp, Aart 2 2008 An introduction to Knuth-Bendix completion. Zbl 0658.68030Klop, Jan Willem; Middeldorp, Aart 1 1988 Complexity of conditional term rewriting. Zbl 1398.68275Kop, Cynthia; Middeldorp, Aart; Sternagel, Thomas 1 2017 Multi-completion with termination tools. Zbl 1362.68253Winkler, Sarah; Sato, Haruhiko; Middeldorp, Aart; Kurihara, Masahito 1 2013 Decreasing diagrams and relative termination. Zbl 1291.68347Hirokawa, Nao; Middeldorp, Aart 1 2010 Beyond dependency graphs. Zbl 1250.68143Korp, Martin; Middeldorp, Aart 1 2009 AC-KBO revisited. Zbl 1379.68277Yamada, Akihisa; Winkler, Sarah; Hirokawa, Nao; Middeldorp, Aart 1 2016 Increasing interpretations. Zbl 1191.68368Zankl, Harald; Middeldorp, Aart 1 2009 Polynomial interpretations over the reals do not subsume polynomial interpretations over the integers. Zbl 1236.68142Neurauter, Friedrich; Middeldorp, Aart 1 2010 AC completion with termination tools. Zbl 1341.68198Winkler, Sarah; Middeldorp, Aart 1 2011 Finding and certifying loops. Zbl 1274.68153Zankl, Harald; Sternagel, Christian; Hofbauer, Dieter; Middeldorp, Aart 1 2010 Transforming SAT into termination of rewriting. Zbl 1347.68202Zankl, Harald; Sternagel, Christian; Middeldorp, Aart 1 2009 A sequential reduction strategy. Zbl 0988.68554Antoy, Sergio; Middeldorp, Aart 1 1994 Simple termination of rewrite systems. Zbl 0827.68062Middeldorp, Aart 1 1995 Eliminating dummy elimination. Zbl 0963.68181Giesl, Jürgen; Middeldorp, Aart 1 2000 A new and formalized proof of abstract completion. Zbl 1416.68164Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian 1 2014 Leftmost outermost revisited. Zbl 1366.68119Hirokawa, Nao; Middeldorp, Aart; Moser, Georg 1 2015 Conditional complexity. Zbl 1366.68121Kop, Cynthia; Middeldorp, Aart; Sternagel, Thomas 1 2015 Functional and logic programming. 4th Fuji international symposium, FLOPS ’99, Tsukuba, Japan, November 11–13, 1999. Proceedings. Zbl 0929.00068 1 1999 Normalized completion revisited. Zbl 1356.68127Winkler, Sarah; Middeldorp, Aart 1 2011 Beyond Peano arithmetic – automatically proving termination of the Goodstein sequence. Zbl 1356.68206Winkler, Sarah; Zankl, Harald; Middeldorp, Aart 1 2011 Completion for logically constrained rewriting. Zbl 1462.68098Winkler, Sarah; Middeldorp, Aart 1 2018 Ordinals and Knuth-Bendix orders. Zbl 1352.03018Winkler, Sarah; Zankl, Harald; Middeldorp, Aart 1 2012 Cops and CoCoWeb: infrastructure for confluence tools. Zbl 06958109Hirokawa, Nao; Nagele, Julian; Middeldorp, Aart 1 2018 Completion for logically constrained rewriting. Zbl 1462.68098Winkler, Sarah; Middeldorp, Aart 1 2018 Cops and CoCoWeb: infrastructure for confluence tools. Zbl 06958109Hirokawa, Nao; Nagele, Julian; Middeldorp, Aart 1 2018 CSI: new evidence - a progress report. Zbl 06778416Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart 2 2017 Infinite runs in abstract completion. Zbl 1441.68113Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian; Winkler, Sarah 2 2017 Complexity of conditional term rewriting. Zbl 1398.68275Kop, Cynthia; Middeldorp, Aart; Sternagel, Thomas 1 2017 Automating the first-order theory of rewriting for left-linear right-ground rewrite systems. Zbl 1387.68149Rapp, Franziska; Middeldorp, Aart 5 2016 Certification of classical confluence results for left-linear term rewrite systems. Zbl 1478.68117Nagele, Julian; Middeldorp, Aart 2 2016 AC-KBO revisited. Zbl 1379.68277Yamada, Akihisa; Winkler, Sarah; Hirokawa, Nao; Middeldorp, Aart 1 2016 Improving automatic confluence analysis of rewrite systems by redundant rules. Zbl 1366.68125Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart 2 2015 Beyond polynomials and Peano arithmetic – automation of elementary and ordinal interpretations. Zbl 1315.68168Zankl, Harald; Winkler, Sarah; Middeldorp, Aart 2 2015 Leftmost outermost revisited. Zbl 1366.68119Hirokawa, Nao; Middeldorp, Aart; Moser, Georg 1 2015 Conditional complexity. Zbl 1366.68121Kop, Cynthia; Middeldorp, Aart; Sternagel, Thomas 1 2015 Conditional confluence (system description). Zbl 1416.68181Sternagel, Thomas; Middeldorp, Aart 6 2014 A new and formalized proof of abstract completion. Zbl 1416.68164Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian 1 2014 Uncurrying for termination and complexity. Zbl 1286.68262Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald 4 2013 Multi-completion with termination tools. Zbl 1362.68253Winkler, Sarah; Sato, Haruhiko; Middeldorp, Aart; Kurihara, Masahito 1 2013 Ordinals and Knuth-Bendix orders. Zbl 1352.03018Winkler, Sarah; Zankl, Harald; Middeldorp, Aart 1 2012 CSI – a confluence tool. Zbl 1341.68199Zankl, Harald; Felgenhauer, Bertram; Middeldorp, Aart 10 2011 Decreasing diagrams and relative termination. Zbl 1243.68199Hirokawa, Nao; Middeldorp, Aart 8 2011 Joint spectral radius theory for automated complexity analysis of rewrite systems. Zbl 1307.68042Middeldorp, Aart; Moser, Georg; Neurauter, Friedrich; Waldmann, Johannes; Zankl, Harald 6 2011 Labelings for decreasing diagrams. Zbl 1236.68157Zankl, Harald; Felgenhauer, Bertram; Middeldorp, Aart 5 2011 Revisiting matrix interpretations for proving termination of term rewriting. Zbl 1236.68141Neurauter, Friedrich; Middeldorp, Aart 3 2011 Layer systems for proving confluence. Zbl 1246.68136Felgenhauer, Bertram; Zankl, Harald; Middeldorp, Aart 3 2011 AC completion with termination tools. Zbl 1341.68198Winkler, Sarah; Middeldorp, Aart 1 2011 Normalized completion revisited. Zbl 1356.68127Winkler, Sarah; Middeldorp, Aart 1 2011 Beyond Peano arithmetic – automatically proving termination of the Goodstein sequence. Zbl 1356.68206Winkler, Sarah; Zankl, Harald; Middeldorp, Aart 1 2011 Satisfiability of non-linear (ir)rational arithmetic. Zbl 1310.68126Zankl, Harald; Middeldorp, Aart 12 2010 Revisiting matrix interpretations for polynomial derivational complexity of term rewriting. Zbl 1306.68083Neurauter, Friedrich; Zankl, Harald; Middeldorp, Aart 7 2010 Termination tools in ordered completion. Zbl 1291.68376Winkler, Sarah; Middeldorp, Aart 3 2010 Optimizing \(\text{mkb}_{\text{TT}}\). Zbl 1236.68156Winkler, Sarah; Sato, Haruhiko; Middeldorp, Aart; Kurihara, Masahito 3 2010 Decreasing diagrams and relative termination. Zbl 1291.68347Hirokawa, Nao; Middeldorp, Aart 1 2010 Polynomial interpretations over the reals do not subsume polynomial interpretations over the integers. Zbl 1236.68142Neurauter, Friedrich; Middeldorp, Aart 1 2010 Finding and certifying loops. Zbl 1274.68153Zankl, Harald; Sternagel, Christian; Hofbauer, Dieter; Middeldorp, Aart 1 2010 KBO orientability. Zbl 1184.68303Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart 8 2009 Match-bounds revisited. Zbl 1192.68399Korp, Martin; Middeldorp, Aart 3 2009 Beyond dependency graphs. Zbl 1250.68143Korp, Martin; Middeldorp, Aart 1 2009 Increasing interpretations. Zbl 1191.68368Zankl, Harald; Middeldorp, Aart 1 2009 Transforming SAT into termination of rewriting. Zbl 1347.68202Zankl, Harald; Sternagel, Christian; Middeldorp, Aart 1 2009 Maximal termination. Zbl 1145.68446Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald 10 2008 Uncurrying for termination. Zbl 1182.68094Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald 7 2008 Root-labeling. Zbl 1145.68453Sternagel, Christian; Middeldorp, Aart 3 2008 Multi-completion with termination tools. (System description). Zbl 1165.68472Sato, Haruhiko; Winkler, Sarah; Kurihara, Masahito; Middeldorp, Aart 3 2008 Increasing interpretations. Zbl 1166.68381Zankl, Harald; Middeldorp, Aart 2 2008 Match-bounds with dependency pairs for proving termination of rewrite systems. Zbl 1156.68430Korp, Martin; Middeldorp, Aart 2 2008 Tyrolean termination tool: techniques and features. Zbl 1111.68048Hirokawa, Nao; Middeldorp, Aart 28 2007 SAT solving for termination analysis with polynomial interpretations. Zbl 1214.68352Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald 24 2007 Proving termination of rewrite systems using bounds. Zbl 1203.68077Korp, Martin; Middeldorp, Aart 4 2007 Predictive labeling with dependency pairs using SAT. Zbl 1213.68349Koprowski, Adam; Middeldorp, Aart 4 2007 Satisfying KBO constraints. Zbl 1203.68080Zankl, Harald; Middeldorp, Aart 3 2007 Constraints for argument filterings. Zbl 1131.68468Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart 3 2007 Predictive labeling. Zbl 1151.68446Hirokawa, Nao; Middeldorp, Aart 3 2006 Automating the dependency pair method. Zbl 1081.68038Hirokawa, Nao; Middeldorp, Aart 26 2005 Tyrolean termination tool. Zbl 1078.68656Hirokawa, Nao; Middeldorp, Aart 12 2005 Decidable call-by-need computations in term rewriting. Zbl 1101.68628Durand, Iréne; Middeldorp, Aart 6 2005 Processes, terms and cycles: steps on the road to infinity. Essays dedicated to Jan Willem Klop on the occasion of his 60th birthday. Zbl 1097.68007 3 2005 Dependency pairs revisited. Zbl 1187.68275Hirokawa, Nao; Middeldorp, Aart 19 2004 Transformation techniques for context-sensitive rewrite systems. Zbl 1104.68056Giesl, Jürgen; Middeldorp, Aart 18 2004 Polynomial interpretations with negative coefficients. Zbl 1109.68501Hirokawa, Nao; Middeldorp, Aart 10 2004 Automating the dependency pair method. Zbl 1278.68264Hirokawa, Nao; Middeldorp, Aart 5 2003 Innermost termination of context-sensitive rewriting. Zbl 1015.68106Giesl, Jürgen; Middeldorp, Aart 5 2003 Tsukuba termination tool. Zbl 1038.68561Hirokawa, Nao; Middeldorp, Aart 3 2003 Approximations for strategies and termination. Zbl 1270.68132Middeldorp, Aart 8 2002 Relative undecidability in term rewriting. II: The confluence hierarchy. Zbl 1012.68097Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans 6 2002 Relative undecidability in term rewriting. I: The termination hierarchy. Zbl 1012.68096Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans 4 2002 Approximating dependency graphs using tree automata techniques. Zbl 0988.68162Middeldorp, Aart 14 2001 On the modularity of deciding call-by-need. Zbl 0978.68071Durand, Irène; Middeldorp, Aart 2 2001 Logicality of conditional rewrite systems. Zbl 0938.68050Yamada, T.; Avenhaus, J.; Loría-Sáenz, C.; Middeldorp, A. 4 2000 Type introduction for equational rewriting. Zbl 0957.68050Middeldorp, Aart; Ohsaki, Hitoshi 2 2000 Equational termination by semantic labelling. Zbl 0973.68094Ohsaki, Hitoshi; Middeldorp, Aart; Giesl, Jürgen 2 2000 Eliminating dummy elimination. Zbl 0963.68181Giesl, Jürgen; Middeldorp, Aart 1 2000 Functional and logic programming. 4th Fuji international symposium, FLOPS ’99, Tsukuba, Japan, November 11–13, 1999. Proceedings. Zbl 0929.00068 1 1999 Strongly sequential and inductively sequential term rewriting systems. Zbl 1339.68136Hanus, Michael; Lucas, Salvador; Middeldorp, Aart 8 1998 A deterministic lazy narrowing calculus. Zbl 0983.68090Middeldorp, Aart; Okui, Satoshi 6 1998 Simple termination of rewrite systems. Zbl 0903.68106Middeldorp, Aart; Zantema, Hans 9 1997 Relative undecidability in term rewriting. Zbl 0884.68067Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans 3 1997 Lazy narrowing: Strong completeness and eager variable elimination. Zbl 0874.68157Middeldorp, Aart; Okui, Satoshi; Ida, Tetsuo 11 1996 A sequential reduction strategy. Zbl 0872.68080Antoy, Sergio; Middeldorp, Aart 5 1996 Transforming termination by self-labelling. Zbl 1412.68112Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans 5 1996 Simple termination is difficult. Zbl 0815.68064Middeldorp, Aart; Gramlich, Bernhard 10 1995 Transforming termination by self-labelling. Zbl 0939.68684Ferreira, Maria C. F.; Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans 6 1995 Level-confluence of conditional rewrite systems with extra variables in right-hand sides. Zbl 0939.68679Suzuki, Taro; Middeldorp, Aart; Ida, Tetsuo 3 1995 Simple termination of rewrite systems. Zbl 0827.68062Middeldorp, Aart 1 1995 Completeness results for basic narrowing. Zbl 0810.68088Middeldorp, Aart; Hamoen, Erik 23 1994 Modularity of confluence: A simplified proof. Zbl 0795.68111Klop, Jan Willem; Middeldorp, Aart; Toyama, Yoshihito; de Vrijer, Roel 6 1994 Completeness of combinations of conditional constructor systems. Zbl 0942.68592Middeldorp, Aart 2 1994 A sequential reduction strategy. Zbl 0988.68554Antoy, Sergio; Middeldorp, Aart 1 1994 Modular properties of conditional term rewriting systems. Zbl 0804.68071Middeldorp, Aart 22 1993 Completeness of combinations of constructor systems. Zbl 0778.68050Middeldorp, Aart; Toyama, Yoshihito 12 1993 Sequentiality in orthogonal term rewriting systems. Zbl 0746.68047Klop, Jan Willem; Middeldorp, Aart 16 1991 A sufficient condition for the termination of the direct sum of term rewriting systems. Zbl 0716.68054Middeldorp, Aart 7 1989 An introduction to Knuth-Bendix completion. Zbl 0658.68030Klop, Jan Willem; Middeldorp, Aart 1 1988 all cited Publications top 5 cited Publications all top 5 Cited by 279 Authors 37 Middeldorp, Aart 31 Lucas, Salvador 12 Giesl, Jürgen 12 Thiemann, René 11 Meseguer Guaita, José 11 Zankl, Harald 11 Zantema, Hans 10 Winkler, Sarah 9 Gutiérrez, Raúl 9 Hirokawa, Nao 9 Moser, Georg 9 Nishida, Naoki 8 Alpuente, María 8 Schneider-Kamp, Peter 7 Felgenhauer, Bertram 7 Sakai, Masahiko 7 Vidal, Germán 6 Endrullis, Jörg 6 Iborra, José 6 Ohlebusch, Enno 6 Waldmann, Johannes 5 Ábrahám, Erika 5 Alarcón, Beatriz 5 Durand, Irène A. 5 Escobar, Santiago 5 Fuhs, Carsten 5 Rubio, Albert 5 Sternagel, Christian 5 Urbain, Xavier 4 Antoy, Sergio 4 Aoto, Takahito 4 Blanchette, Jasmin Christian 4 Blanqui, Frédéric 4 Durán, Francisco 4 Falaschi, Moreno 4 Geser, Alfons 4 Gramlich, Bernhard 4 Hanus, Michael 4 Kirchner, Hélène 4 Klop, Jan Willem 4 Waldmann, Uwe 4 Yamada, Akihisa 3 Avanzini, Martin 3 Emmes, Fabian 3 Falke, Stephan 3 Gnaedig, Isabelle 3 Gonçalves, Ricardo 3 Ida, Tetsuo 3 Jouannaud, Jean-Pierre 3 Knorr, Matthias 3 Kop, Cynthia 3 Kremer, Gereon 3 Kurihara, Masahito 3 Leite, João 3 Marché, Claude 3 Marchiori, Massimo 3 Moreno, Ginés 3 Rao, M. R. K. Krishna 3 Simonsen, Jakob Grue 3 Ströder, Thomas 3 Toyama, Yoshihito 2 Aguirre, Luis Antonio 2 Aschermann, Cornelius 2 Borralleras, Cristina 2 Cimatti, Alessandro 2 Codish, Michael 2 Corzilius, Florian 2 del Vado Vírseda, Rafael 2 Eguchi, Naohi 2 Fernández, Maribel 2 Fernández, Mirtha-Lina 2 Fissore, Olivier 2 Frohn, Florian 2 Geuvers, Jan Herman 2 Griggio, Alberto 2 Hensel, Jera 2 Hofbauer, Dieter 2 Khanh, To Van 2 Kikuchi, Kentaro 2 Korp, Martin 2 Le Verge, Hervé 2 Liu, Jiaxiang 2 Lochmann, Alexander 2 Martí-Oliet, Narciso 2 Nagashima, Masanori 2 Nagele, Julian 2 Navarro-Marset, Rafael 2 Neurauter, Friedrich 2 Noschinski, Lars 2 Ogawa, Mizuhito 2 Oyamaguchi, Michio 2 Palomino, Miguel 2 Parting, Michael 2 Pita, Isabel 2 Plücker, Martin 2 Rodríguez-Carbonell, Enric 2 Sakabe, Toshiki 2 Salinier, Bruno 2 Saouter, Yannick 2 Sato, Haruhiko ...and 179 more Authors all top 5 Cited in 27 Serials 41 Theoretical Computer Science 26 Journal of Automated Reasoning 20 Information and Computation 15 Information Processing Letters 9 Applicable Algebra in Engineering, Communication and Computing 9 Logical Methods in Computer Science 8 Journal of Symbolic Computation 8 Journal of Logical and Algebraic Methods in Programming 6 Theory and Practice of Logic Programming 3 Artificial Intelligence 3 ACM Transactions on Computational Logic 2 Formal Aspects of Computing 2 Higher-Order and Symbolic Computation 1 Fuzzy Sets and Systems 1 Journal of Computer and System Sciences 1 The Journal of Symbolic Logic 1 MSCS. Mathematical Structures in Computer Science 1 International Journal of Foundations of Computer Science 1 Indagationes Mathematicae. New Series 1 Formal Methods in System Design 1 Journal of Functional Programming 1 Annals of Mathematics and Artificial Intelligence 1 Sbornik: Mathematics 1 RAIRO. Theoretical Informatics and Applications 1 Mathematics in Computer Science 1 Logica Universalis 1 Acta Universitatis Sapientiae. Informatica all top 5 Cited in 8 Fields 263 Computer science (68-XX) 51 Mathematical logic and foundations (03-XX) 2 Combinatorics (05-XX) 2 Order, lattices, ordered algebraic structures (06-XX) 2 Operations research, mathematical programming (90-XX) 1 Field theory and polynomials (12-XX) 1 Algebraic geometry (14-XX) 1 Dynamical systems and ergodic theory (37-XX) Citations by Year