| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Aart Middeldorp |
Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems.  |
LPAR  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Winkler, Harald Zankl, Aart Middeldorp |
Ordinals and Knuth-Bendix Orders. |
LPAR |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Neurauter, Aart Middeldorp |
On the Domain and Dimension Hierarchy of Matrix Interpretations. |
LPAR |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp |
Decreasing Diagrams and Relative Termination. |
J. Autom. Reasoning |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl |
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. |
CAI |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Winkler, Aart Middeldorp |
AC Completion with Termination Tools. |
CADE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Bertram Felgenhauer, Aart Middeldorp |
CSI - A Confluence Tool. |
CADE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Neurauter, Aart Middeldorp |
Revisiting Matrix Interpretations for Proving Termination of Term Rewriting. |
RTA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Bertram Felgenhauer, Aart Middeldorp |
Labelings for Decreasing Diagrams. |
RTA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bertram Felgenhauer, Harald Zankl, Aart Middeldorp |
Layer Systems for Proving Confluence. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Nao Hirokawa, Aart Middeldorp |
Uncurrying for Innermost Termination and Derivational Complexity |
HOR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Winkler, Aart Middeldorp |
Termination Tools in Ordered Completion. |
IJCAR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp |
Decreasing Diagrams and Relative Termination. |
IJCAR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Neurauter, Aart Middeldorp, Harald Zankl |
Monotonicity Criteria for Polynomial Interpretations over the Naturals. |
IJCAR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Aart Middeldorp |
Satisfiability of Non-linear (Ir)rational Arithmetic. |
LPAR (Dakar) |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Neurauter, Harald Zankl, Aart Middeldorp |
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. |
LPAR (Yogyakarta) |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara |
Optimizing mkbTT. |
RTA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Neurauter, Aart Middeldorp |
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers. |
RTA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp |
Finding and Certifying Loops. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Haruhiko Sato, Masahito Kurihara, Sarah Winkler, Aart Middeldorp |
Constraint-Based Multi-Completion Procedures for Term Rewriting Systems. |
IEICE Transactions |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin Korp, Aart Middeldorp |
Match-bounds revisited. |
Inf. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp |
Preface. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Christian Sternagel, Aart Middeldorp |
Transforming SAT into Termination of Rewriting. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Durand, Aart Middeldorp |
On the Complexity of Deciding Call-by-Need |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp |
Decreasing Diagrams and Relative Termination |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Harald Zankl, Nao Hirokawa, Aart Middeldorp |
KBO Orientability. |
J. Autom. Reasoning |
2009 |
DBLP DOI BibTeX RDF |
Knuth-Bendix order, Termination, Term rewriting |
| 1 | Harald Zankl, Aart Middeldorp |
Increasing interpretations. |
Ann. Math. Artif. Intell. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Korp, Aart Middeldorp |
Beyond Dependency Graphs. |
CADE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp |
Tyrolean Termination Tool 2. |
RTA |
2009 |
DBLP DOI BibTeX RDF |
automation, termination, term rewriting |
| 1 | René Thiemann, Aart Middeldorp |
Innermost Termination of Rewrite Systems by Labeling. |
Electr. Notes Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp |
Multi-completion with Termination Tools (System Description). |
IJCAR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Korp, Aart Middeldorp |
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp, Harald Zankl |
Uncurrying for Termination. |
LPAR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl |
Maximal Termination. |
RTA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Sternagel, Aart Middeldorp |
Root-Labeling. |
RTA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Aart Middeldorp |
Increasing Interpretations. |
AISC/MKM/Calculemus |
2008 |
DBLP DOI BibTeX RDF |
Related Topics implementations of symbolic computation systems, logic and symbolic computing |
| 1 | Nao Hirokawa, Aart Middeldorp |
Tyrolean termination tool: Techniques and features. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Koprowski, Aart Middeldorp |
Predictive Labeling with Dependency Pairs Using SAT. |
CADE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl |
SAT Solving for Termination Analysis with Polynomial Interpretations. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl |
Implementing RPO and POLO using SAT. |
Deduction and Decision Procedures |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Korp, Aart Middeldorp |
Proving Termination of Rewrite Systems Using Bounds. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Aart Middeldorp |
Satisfying KBO Constraints. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Nao Hirokawa, Aart Middeldorp |
Constraints for Argument Filterings. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Zankl, Aart Middeldorp |
Satisfying KBO Constraints |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp |
Predictive Labeling. |
RTA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Durand, Aart Middeldorp |
Decidable call-by-need computations in term rewriting. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp |
Automating the dependency pair method. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp |
Tyrolean Termination Tool. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel C. de Vrijer (eds.) |
Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday |
Processes, Terms and Cycles |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jürgen Giesl, Aart Middeldorp |
Transformation techniques for context-sensitive rewrite systems. |
J. Funct. Program. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp |
Dependency Pairs Revisited. |
RTA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mircea Marin, Aart Middeldorp |
New completeness results for lazy conditional narrowing. |
PPDP |
2004 |
DBLP DOI BibTeX RDF |
conditional rewriting, narrowing, evaluation strategies |
| 1 | Nao Hirokawa, Aart Middeldorp |
Polynomial Interpretations with Negative Coefficients. |
AISC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp |
Preface. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp |
Automating the Dependency Pair Method. |
CADE |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nao Hirokawa, Aart Middeldorp |
Tsukuba Termination Tool. |
RTA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Taro Suzuki, Mohamed Hamada |
Complete Selection Functions for a Lazy Conditional Narrowing Calculus. |
Journal of Functional and Logic Programming |
2002 |
DBLP BibTeX RDF |
|
| 1 | Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema |
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema |
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp |
Approximations for Strategies and Termination. |
Electr. Notes Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Giesl, Aart Middeldorp |
Innermost Termination of Context-Sensitive Rewriting. |
Developments in Language Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp |
Approximating Dependency Graphs Using Tree Automata Techniques. |
IJCAR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp (eds.) |
Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings |
RTA |
2001 |
DBLP BibTeX RDF |
|
| 1 | Taro Suzuki, Aart Middeldorp |
A Complete Selection Function for Lazy Conditional Narrowing. |
FLOPS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Durand, Aart Middeldorp |
On the Modularity of Deciding Call-by-Need. |
FoSSaCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp |
Logicality of conditional rewrite systems. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Hitoshi Ohsaki |
Type Introduction for Equational Rewriting. |
Acta Inf. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Jürgen Giesl, Aart Middeldorp |
Eliminating Dummy Elimination. |
CADE |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl |
Equational Termination by Semantic Labelling. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Giesl, Aart Middeldorp |
Transforming Context-Sensitive Rewrite Systems. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Taisuke Sato (eds.) |
Functional and Logic Programming, 4th Fuji International Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999, Proceedings |
FLOPS |
1999 |
DBLP BibTeX RDF |
|
| 1 | Aart Middeldorp |
Term Rewriting. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Hanus, Salvador Lucas, Aart Middeldorp |
Strongly Sequential and Inductively Sequential Term Rewriting Systems. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Satoshi Okui |
A Deterministic Lazy Narrowing Calculus. |
J. Symb. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Hans Zantema |
Simple Termination of Rewrite Systems. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Ohsaki, Aart Middeldorp |
Type Introduction for Equational Rewriting. |
LFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Irène Durand, Aart Middeldorp |
Decidable Call by Need Computations in term Rewriting (Extended Abstract). |
CADE |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema |
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. |
TAPSOFT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp |
Logicality of Conditional Rewrite Systems. |
TAPSOFT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp |
Call by Need Computations to Root-Stable Form. |
POPL |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Antoy, Aart Middeldorp |
A Sequential Reduction Strategy. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Satoshi Okui, Tetsuo Ida |
Lazy Narrowing: Strong Completeness and Eager Variable Elimination. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema |
Transforming Termination by Self-Labelling. |
CADE |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema |
Relative Undecidability in Term Rewriting. |
CSL |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Bernhard Gramlich |
Simple termination is difficult. |
Appl. Algebra Eng. Commun. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoshi Okui, Aart Middeldorp, Tetsuo Ida |
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). |
TAPSOFT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Taro Suzuki, Aart Middeldorp, Tetsuo Ida |
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. |
RTA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Koichi Nakahara, Aart Middeldorp, Tetsuo Ida |
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming |
PLILP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer |
Modularity of Confluence: A Simplified Proof. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp |
Completeness of Combinations of Conditional Constructor Systems. |
J. Symb. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Erik Hamoen |
Completeness Results for Basic Narrowing. |
Appl. Algebra Eng. Commun. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Hans Zantema |
Simple Termination Revisited. |
CADE |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Antoy, Aart Middeldorp |
A Sequential Reduction Strategy. |
ALP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Yoshihito Toyama |
Completeness of Combinations of Constructor Systems. |
J. Symb. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp |
Modular Properties of Conditional Term Rewriting Systems |
Inf. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Bernhard Gramlich |
Simple Termination is Difficult. |
RTA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Erik Hamoen |
Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract). |
ALP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp |
Completeness of Combinations of Conditional Constructor Systems. |
CTRS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Willem Klop, Aart Middeldorp |
Sequentiality in Orthogonal Term Rewriting Systems. |
J. Symb. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Aart Middeldorp, Yoshihito Toyama |
Completeness of Combinations of Constructor Systems. |
RTA |
1991 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")