@article{MiddeldorpG95,
  title = {Simple Termination Difficult},
  author = {Aart Middeldorp and Bernhard Gramlich},
  year = {1995},
  tags = {termination},
  researchr = {https://researchr.org/publication/MiddeldorpG95},
  cites = {0},
  citedby = {0},
  journal = {Appl. Algebra Eng. Commun. Comput.},
  volume = {6},
  pages = {115-128},
}

@inproceedings{GieslM99,
  title = {Transforming Context-Sensitive Rewrite Systems},
  author = {Jürgen Giesl and Aart Middeldorp},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1631/16310271.htm},
  tags = {graph-rewriting, context-aware, rewriting},
  researchr = {https://researchr.org/publication/GieslM99},
  cites = {0},
  citedby = {0},
  pages = {271-287},
  booktitle = {Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings},
  editor = {Paliath Narendran and Michaël Rusinowitch},
  volume = {1631},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66201-4},
}

@article{MiddeldorpSH02,
  title = {Complete Selection Functions for a Lazy Conditional Narrowing Calculus},
  author = {Aart Middeldorp and Taro Suzuki and Mohamed Hamada},
  year = {2002},
  url = {http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/2002/S02-01/JFLP-A02-03.pdf},
  tags = {laziness, completeness},
  researchr = {https://researchr.org/publication/MiddeldorpSH02},
  cites = {0},
  citedby = {0},
  journal = {Journal of Functional and Logic Programming},
  volume = {2002},
}

@inproceedings{Middeldorp89,
  title = {A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems},
  author = {Aart Middeldorp},
  year = {1989},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Middeldorp89},
  cites = {0},
  citedby = {0},
  pages = {396-401},
  booktitle = {Proceedings, Fourth Annual Symposium on Logic in Computer Science, 5-8 June, 1989, Asilomar Conference Center, Pacific Grove, California, USA},
  publisher = {IEEE Computer Society},
}

@inproceedings{HirokawaM05:0,
  title = {Tyrolean Termination Tool},
  author = {Nao Hirokawa and Aart Middeldorp},
  year = {2005},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=175},
  tags = {termination},
  researchr = {https://researchr.org/publication/HirokawaM05%3A0},
  cites = {0},
  citedby = {0},
  pages = {175-184},
  booktitle = {Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings},
  editor = {Jürgen Giesl},
  volume = {3467},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-25596-6},
}

@inproceedings{GieslM00,
  title = {Eliminating Dummy Elimination},
  author = {Jürgen Giesl and Aart Middeldorp},
  year = {2000},
  researchr = {https://researchr.org/publication/GieslM00},
  cites = {0},
  citedby = {0},
  pages = {309-323},
  booktitle = {Automated Deduction - CADE-17, 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000, Proceedings},
  editor = {David A. McAllester},
  volume = {1831},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67664-3},
}

@inproceedings{HirokawaMZ08,
  title = {Uncurrying for Termination},
  author = {Nao Hirokawa and Aart Middeldorp and Harald Zankl},
  year = {2008},
  doi = {10.1007/978-3-540-89439-1_46},
  url = {http://dx.doi.org/10.1007/978-3-540-89439-1_46},
  tags = {termination},
  researchr = {https://researchr.org/publication/HirokawaMZ08},
  cites = {0},
  citedby = {0},
  pages = {667-681},
  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings},
  editor = {Iliano Cervesato and Helmut Veith and Andrei Voronkov},
  volume = {5330},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-89438-4},
}

@inproceedings{HirokawaM03,
  title = {Automating the Dependency Pair Method},
  author = {Nao Hirokawa and Aart Middeldorp},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2741&spage=32},
  researchr = {https://researchr.org/publication/HirokawaM03},
  cites = {0},
  citedby = {0},
  pages = {32-46},
  booktitle = {Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings},
  editor = {Franz Baader},
  volume = {2741},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40559-3},
}

@article{GieslM04,
  title = {Transformation techniques for context-sensitive rewrite systems},
  author = {Jürgen Giesl and Aart Middeldorp},
  year = {2004},
  doi = {10.1017/S0956796803004945},
  url = {http://dx.doi.org/10.1017/S0956796803004945},
  tags = {graph transformation, graph-rewriting, transformation system, context-aware, rewriting, transformation},
  researchr = {https://researchr.org/publication/GieslM04},
  cites = {0},
  citedby = {0},
  journal = {Journal of Functional Programming},
  volume = {14},
  number = {4},
  pages = {379-427},
}

@inproceedings{OhsakiM97,
  title = {Type Introduction for Equational Rewriting},
  author = {Hitoshi Ohsaki and Aart Middeldorp},
  year = {1997},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/OhsakiM97},
  cites = {0},
  citedby = {0},
  pages = {283-293},
  booktitle = {Logical Foundations of Computer Science, 4th International Symposium, LFCS 97, Yaroslavl, Russia, July 6-12, 1997, Proceedings},
  editor = {Sergei I. Adian and Anil Nerode},
  volume = {1234},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-63045-7},
}

@inproceedings{KoprowskiM07,
  title = {Predictive Labeling with Dependency Pairs Using SAT},
  author = {Adam Koprowski and Aart Middeldorp},
  year = {2007},
  doi = {10.1007/978-3-540-73595-3_31},
  url = {http://dx.doi.org/10.1007/978-3-540-73595-3_31},
  researchr = {https://researchr.org/publication/KoprowskiM07},
  cites = {0},
  citedby = {0},
  pages = {410-425},
  booktitle = {Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings},
  editor = {Frank Pfenning},
  volume = {4603},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-73594-6},
}

@article{MiddeldorpO98,
  title = {A Deterministic Lazy Narrowing Calculus},
  author = {Aart Middeldorp and Satoshi Okui},
  year = {1998},
  tags = {laziness},
  researchr = {https://researchr.org/publication/MiddeldorpO98},
  cites = {0},
  citedby = {0},
  journal = {Journal of Symbolic Computation},
  volume = {25},
  number = {6},
  pages = {733-757},
}

@inproceedings{FuhsGMSTZ08,
  title = {Maximal Termination},
  author = {Carsten Fuhs and Jürgen Giesl and Aart Middeldorp and Peter Schneider-Kamp and René Thiemann and Harald Zankl},
  year = {2008},
  doi = {10.1007/978-3-540-70590-1_8},
  url = {http://dx.doi.org/10.1007/978-3-540-70590-1_8},
  tags = {termination},
  researchr = {https://researchr.org/publication/FuhsGMSTZ08},
  cites = {0},
  citedby = {0},
  pages = {110-125},
  booktitle = {Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings},
  editor = {Andrei Voronkov},
  volume = {5117},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-70588-8},
}

@article{MiddeldorpZ97,
  title = {Simple Termination of Rewrite Systems},
  author = {Aart Middeldorp and Hans Zantema},
  year = {1997},
  doi = {10.1016/S0304-3975(96)00172-7},
  url = {http://dx.doi.org/10.1016/S0304-3975(96)00172-7},
  tags = {termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/MiddeldorpZ97},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {175},
  number = {1},
  pages = {127-158},
}

@inproceedings{KorpSZM09,
  title = {Tyrolean Termination Tool 2},
  author = {Martin Korp and Christian Sternagel and Harald Zankl and Aart Middeldorp},
  year = {2009},
  doi = {10.1007/978-3-642-02348-4_21},
  url = {http://dx.doi.org/10.1007/978-3-642-02348-4_21},
  tags = {termination},
  researchr = {https://researchr.org/publication/KorpSZM09},
  cites = {0},
  citedby = {0},
  pages = {295-304},
  booktitle = {Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings},
  editor = {Ralf Treinen},
  volume = {5595},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-02347-7},
}

@article{KlopM91,
  title = {Sequentiality in Orthogonal Term Rewriting Systems},
  author = {Jan Willem Klop and Aart Middeldorp},
  year = {1991},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KlopM91},
  cites = {0},
  citedby = {0},
  journal = {Journal of Symbolic Computation},
  volume = {12},
  number = {2},
  pages = {161-196},
}

@article{Middeldorp93,
  title = {Modular Properties of Conditional Term Rewriting Systems},
  author = {Aart Middeldorp},
  year = {1993},
  month = {May},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Middeldorp93},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {104},
  number = {1},
  pages = {110-158},
}

@article{GeserMOZ02,
  title = {Relative Undecidability in Term Rewriting: I. The Termination Hierarchy},
  author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema},
  year = {2002},
  doi = {10.1006/inco.2002.3120},
  url = {http://dx.doi.org/10.1006/inco.2002.3120},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GeserMOZ02},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {178},
  number = {1},
  pages = {101-131},
}

@inproceedings{GeserMOZ97,
  title = {Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules},
  author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema},
  year = {1997},
  tags = {rule-based, termination, graph-rewriting, rules, rewriting},
  researchr = {https://researchr.org/publication/GeserMOZ97},
  cites = {0},
  citedby = {0},
  pages = {237-248},
  booktitle = {TAPSOFT 97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings},
  editor = {Michel Bidoit and Max Dauchet},
  volume = {1214},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-62781-2},
}

@inproceedings{MiddeldorpG93,
  title = {Simple Termination is Difficult},
  author = {Aart Middeldorp and Bernhard Gramlich},
  year = {1993},
  tags = {termination},
  researchr = {https://researchr.org/publication/MiddeldorpG93},
  cites = {0},
  citedby = {0},
  pages = {228-242},
  booktitle = {Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June  16-18, 1993, Proceedings},
  editor = {Claude Kirchner},
  volume = {690},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-56868-9},
}

@inproceedings{GieslM02,
  title = {Innermost Termination of Context-Sensitive Rewriting},
  author = {Jürgen Giesl and Aart Middeldorp},
  year = {2002},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2450&spage=231},
  tags = {termination, graph-rewriting, context-aware, rewriting},
  researchr = {https://researchr.org/publication/GieslM02},
  cites = {0},
  citedby = {0},
  pages = {231-244},
  booktitle = {Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers},
  editor = {Masami Ito and Masafumi Toyama},
  volume = {2450},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40431-7},
}

@inproceedings{HirokawaM03:0,
  title = {Tsukuba Termination Tool},
  author = {Nao Hirokawa and Aart Middeldorp},
  year = {2003},
  url = {http://link.springer.de/link/service/series/0558/bibs/2706/27060311.htm},
  tags = {termination},
  researchr = {https://researchr.org/publication/HirokawaM03%3A0},
  cites = {0},
  citedby = {0},
  pages = {311-320},
  booktitle = {Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings},
  editor = {Robert Nieuwenhuis},
  volume = {2706},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40254-3},
}

@inproceedings{Middeldorp92,
  title = {Completeness of Combinations of Conditional Constructor Systems},
  author = {Aart Middeldorp},
  year = {1992},
  tags = {completeness},
  researchr = {https://researchr.org/publication/Middeldorp92},
  cites = {0},
  citedby = {0},
  pages = {82-96},
  booktitle = {Conditional Term Rewriting Systems, Third International Workshop, CTRS-92, Pont-à-Mousson, France, July 8-10, 1992, Proceedings},
  editor = {Michaël Rusinowitch and Jean-Luc Remy},
  volume = {656},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-56393-8},
}

@inproceedings{OkuiMI95,
  title = {Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract)},
  author = {Satoshi Okui and Aart Middeldorp and Tetsuo Ida},
  year = {1995},
  tags = {laziness, completeness},
  researchr = {https://researchr.org/publication/OkuiMI95},
  cites = {0},
  citedby = {0},
  pages = {394-408},
  booktitle = {TAPSOFT 95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22-26, 1995, Proceedings},
  editor = {Peter D. Mosses and Mogens Nielsen and Michael I. Schwartzbach},
  volume = {915},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-59293-8},
}

@inproceedings{HirokawaM06,
  title = {Predictive Labeling},
  author = {Nao Hirokawa and Aart Middeldorp},
  year = {2006},
  doi = {10.1007/11805618_24},
  url = {http://dx.doi.org/10.1007/11805618_24},
  researchr = {https://researchr.org/publication/HirokawaM06},
  cites = {0},
  citedby = {0},
  pages = {313-327},
  booktitle = {Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings},
  editor = {Frank Pfenning},
  volume = {4098},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-36834-5},
}

@article{GeserMOZ02a,
  title = {Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy},
  author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema},
  year = {2002},
  doi = {10.1006/inco.2002.3150},
  url = {http://dx.doi.org/10.1006/inco.2002.3150},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GeserMOZ02a},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {178},
  number = {1},
  pages = {132-148},
}

@inproceedings{Middeldorp01,
  title = {Approximating Dependency Graphs Using Tree Automata Techniques},
  author = {Aart Middeldorp},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2083/20830593.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Middeldorp01},
  cites = {0},
  citedby = {0},
  pages = {593-610},
  booktitle = {Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings},
  editor = {Rajeev Goré and Alexander Leitsch and Tobias Nipkow},
  volume = {2083},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42254-4},
}

@article{KlopMTV94,
  title = {Modularity of Confluence: A Simplified Proof},
  author = {Jan Willem Klop and Aart Middeldorp and Yoshihito Toyama and Roel C. de Vrijer},
  year = {1994},
  tags = {C++},
  researchr = {https://researchr.org/publication/KlopMTV94},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {49},
  number = {2},
  pages = {101-109},
}

@inproceedings{KorpM07,
  title = {Proving Termination of Rewrite Systems Using Bounds},
  author = {Martin Korp and Aart Middeldorp},
  year = {2007},
  doi = {10.1007/978-3-540-73449-9_21},
  url = {http://dx.doi.org/10.1007/978-3-540-73449-9_21},
  tags = {termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KorpM07},
  cites = {0},
  citedby = {0},
  pages = {273-287},
  booktitle = {Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings},
  editor = {Franz Baader},
  volume = {4533},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-73447-5},
}

@article{MiddeldorpO00,
  title = {Type Introduction for Equational Rewriting},
  author = {Aart Middeldorp and Hitoshi Ohsaki},
  year = {2000},
  url = {http://link.springer.de/link/service/journals/00236/bibs/0036012/00361007.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/MiddeldorpO00},
  cites = {0},
  citedby = {0},
  journal = {Acta Informatica},
  volume = {36},
  number = {12},
  pages = {1007-1029},
}

@inproceedings{Middeldorp89:0,
  title = {Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms},
  author = {Aart Middeldorp},
  year = {1989},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Middeldorp89%3A0},
  cites = {0},
  citedby = {0},
  pages = {263-277},
  booktitle = {Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings},
  editor = {Nachum Dershowitz},
  volume = {355},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-51081-8},
}

@inproceedings{MiddeldorpT91,
  title = {Completeness of Combinations of Constructor Systems},
  author = {Aart Middeldorp and Yoshihito Toyama},
  year = {1991},
  tags = {completeness},
  researchr = {https://researchr.org/publication/MiddeldorpT91},
  cites = {0},
  citedby = {0},
  pages = {188-199},
  booktitle = {Rewriting Techniques and Applications},
  editor = {Ronald V. Book},
  volume = {488},
  series = {Lecture Notes in Computer Science},
  address = {Como, Italy},
  publisher = {Springer},
  isbn = {3-540-53904-2},
}

@inproceedings{MiddeldorpZ94,
  title = {Simple Termination Revisited},
  author = {Aart Middeldorp and Hans Zantema},
  year = {1994},
  tags = {termination},
  researchr = {https://researchr.org/publication/MiddeldorpZ94},
  cites = {0},
  citedby = {0},
  pages = {451-465},
  booktitle = {Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings},
  editor = {Alan Bundy},
  volume = {814},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58156-1},
}

@inproceedings{ZanklM07,
  title = {Satisfying KBO Constraints},
  author = {Harald Zankl and Aart Middeldorp},
  year = {2007},
  doi = {10.1007/978-3-540-73449-9_29},
  url = {http://dx.doi.org/10.1007/978-3-540-73449-9_29},
  tags = {constraints},
  researchr = {https://researchr.org/publication/ZanklM07},
  cites = {0},
  citedby = {0},
  pages = {389-403},
  booktitle = {Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings},
  editor = {Franz Baader},
  volume = {4533},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-73447-5},
}

@article{MiddeldorpH94,
  title = {Completness Results for Basic Narrowing},
  author = {Aart Middeldorp and Erik Hamoen},
  year = {1994},
  researchr = {https://researchr.org/publication/MiddeldorpH94},
  cites = {0},
  citedby = {0},
  journal = {Appl. Algebra Eng. Commun. Comput.},
  volume = {5},
  pages = {213-253},
}

@inproceedings{MiddeldorpOZ96,
  title = {Transforming Termination by Self-Labelling},
  author = {Aart Middeldorp and Hitoshi Ohsaki and Hans Zantema},
  year = {1996},
  tags = {termination},
  researchr = {https://researchr.org/publication/MiddeldorpOZ96},
  cites = {0},
  citedby = {0},
  pages = {373-387},
  booktitle = {Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings},
  editor = {Michael A. McRobbie and John K. Slaney},
  volume = {1104},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-61511-3},
}

@inproceedings{AntoyM94,
  title = {A Sequential Reduction Strategy},
  author = {Sergio Antoy and Aart Middeldorp},
  year = {1994},
  researchr = {https://researchr.org/publication/AntoyM94},
  cites = {0},
  citedby = {0},
  pages = {168-185},
  booktitle = {Algebraic and Logic Programming, 4th International Conference, ALP 94, Madid, Spain, September 14-16, 1994, Proceedings},
  editor = {Giorgio Levi and Mario Rodríguez-Artalejo},
  volume = {850},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58431-5},
}

@article{HanusLM98,
  title = {Strongly Sequential and Inductively Sequential Term Rewriting Systems},
  author = {Michael Hanus and Salvador Lucas and Aart Middeldorp},
  year = {1998},
  doi = {10.1016/S0020-0190(98)00016-7},
  url = {http://dx.doi.org/10.1016/S0020-0190(98)00016-7},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/HanusLM98},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {67},
  number = {1},
  pages = {1-8},
}

@inproceedings{YamadaALM97,
  title = {Logicality of Conditional Rewrite Systems},
  author = {Toshiyuki Yamada and Jürgen Avenhaus and Carlos Loría-Sáenz and Aart Middeldorp},
  year = {1997},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/YamadaALM97},
  cites = {0},
  citedby = {0},
  pages = {141-152},
  booktitle = {TAPSOFT 97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings},
  editor = {Michel Bidoit and Max Dauchet},
  volume = {1214},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-62781-2},
}

@inproceedings{OhsakiMG00,
  title = {Equational Termination by Semantic Labelling},
  author = {Hitoshi Ohsaki and Aart Middeldorp and Jürgen Giesl},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1862/18620457.htm},
  tags = {termination},
  researchr = {https://researchr.org/publication/OhsakiMG00},
  cites = {0},
  citedby = {0},
  pages = {457-471},
  booktitle = {Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings},
  editor = {Peter Clote and Helmut Schwichtenberg},
  volume = {1862},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67895-6},
}

@article{Middeldorp03,
  title = {Preface},
  author = {Aart Middeldorp},
  year = {2003},
  doi = {10.1016/S0890-5401(03)00036-1},
  url = {http://dx.doi.org/10.1016/S0890-5401(03)00036-1},
  researchr = {https://researchr.org/publication/Middeldorp03},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {183},
  number = {2},
  pages = {139},
}

@inproceedings{ZanklM08,
  title = {Increasing Interpretations},
  author = {Harald Zankl and Aart Middeldorp},
  year = {2008},
  doi = {10.1007/978-3-540-85110-3_16},
  url = {http://dx.doi.org/10.1007/978-3-540-85110-3_16},
  researchr = {https://researchr.org/publication/ZanklM08},
  cites = {0},
  citedby = {0},
  pages = {191-205},
  booktitle = {Intelligent Computer Mathematics, 9th International Conference, AISC 2008, 15th Symposium, Calculemus 2008, 7th International Conference, MKM 2008, Birmingham, UK, July 28 - August 1, 2008. Proceedings},
  editor = {Serge Autexier and John Campbell and Julio Rubio and Volker Sorge and Masakazu Suzuki and Freek Wiedijk},
  volume = {5144},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-85109-7},
}

@inproceedings{SternagelM08,
  title = {Root-Labeling},
  author = {Christian Sternagel and Aart Middeldorp},
  year = {2008},
  doi = {10.1007/978-3-540-70590-1_23},
  url = {http://dx.doi.org/10.1007/978-3-540-70590-1_23},
  researchr = {https://researchr.org/publication/SternagelM08},
  cites = {0},
  citedby = {0},
  pages = {336-350},
  booktitle = {Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings},
  editor = {Andrei Voronkov},
  volume = {5117},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-70588-8},
}

@inproceedings{GeserMOZ96,
  title = {Relative Undecidability in Term Rewriting},
  author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema},
  year = {1996},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GeserMOZ96},
  cites = {0},
  citedby = {0},
  pages = {150-166},
  booktitle = {Computer Science Logic, 10th International Workshop, CSL  96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers},
  editor = {Dirk van Dalen and Marc Bezem},
  volume = {1258},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-63172-0},
}

@inproceedings{SuzukiM01,
  title = {A Complete Selection Function for Lazy Conditional Narrowing},
  author = {Taro Suzuki and Aart Middeldorp},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2024/20240201.htm},
  tags = {laziness, completeness},
  researchr = {https://researchr.org/publication/SuzukiM01},
  cites = {0},
  citedby = {0},
  pages = {201-215},
  booktitle = {Functional and Logic Programming, 5th International Symposium, FLOPS 2001, Tokyo, Japan, March 7-9, 2001, Proceedings},
  editor = {Herbert Kuchen and Kazunori Ueda},
  volume = {2024},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-41739-7},
}

@inproceedings{Middeldorp99,
  title = {Term Rewriting},
  author = {Aart Middeldorp},
  year = {1999},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Middeldorp99},
  cites = {0},
  citedby = {0},
  pages = {577},
  booktitle = {Computer Science Logic, 13th International Workshop, CSL  99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings},
  editor = {Jörg Flum and Mario Rodríguez-Artalejo},
  volume = {1683},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66536-6},
}
@proceedings{birthday:2005klop,
  title = {Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday},
  year = {2005},
  researchr = {https://researchr.org/publication/birthday%3A2005klop},
  cites = {0},
  citedby = {0},
  booktitle = {Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday},
  conference = {BIRTHDAY},
  editor = {Aart Middeldorp and Vincent van Oostrom and Femke van Raamsdonk and Roel C. de Vrijer},
  volume = {3838},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-30911-X},
}