Univ.-Prof. Dr. Aart Middeldorp   

Papers in Conference and Workshop Proceedings

Polynomial Termination over ℕ is Undecidable
Fabian Mitterwallner and Aart Middeldorp
Proceedings of the 17th International Workshop on Termination, pp. 21 – 26, 2021

Formalized Signature Extension Results for Confluence, Commutation and Unique Normal Forms
Alexander Lochmann, Fabian Mitterwallner, and Aart Middeldorp
Proceedings of the 10th International Workshop on Confluence, pp. 25 – 30, 2021

Certifying Proofs in the First-Order Theory of Rewriting
Fabian Mitterwallner, Alexander Lochmann, Aart Middeldorp, and Bertram Felgenhauer
Proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 12652, pp. 127 – 144, 2021

A Verified Decision Procedure for the First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems
Alexander Lochmann, Aart Middeldorp, Fabian Mitterwallner, and Bertram Felgenhauer
Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, pages 250 – 263, 2021

Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting
Alexander Lochmann and Aart Middeldorp
Proceedings of the 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 12079, pp. 178 – 194, 2020

Tools in Term Rewriting for Education
Sarah Winkler and Aart Middeldorp
Proceedings of the 8th International Workshop on Theorem Proving Components for Educational Software, Electronic Proceedings in Theoretical Computer Science 313, pp. 54 – 72, 2019

Composing Proof Terms
Christina Kohl and Aart Middeldorp
Proceedings of the 27th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 11716, pp. 337 – 353, 2019

Residual Revisited
Christina Kohl and Aart Middeldorp
Joint Proceedings of the 10th Workshop on Higher-Order Rewriting and the 7th International Workshop on Confluence, pp. 43 – 47, 2019

Confluence Competition 2019
Aart Middeldorp, Julian Nagele, and Kiraku Shintani
Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 11429, pp. 25 – 40, 2019

A Verified Ground Confluence Tool for Linear Variable-Separated Rewrite Systems in Isabelle/HOL
Bertram Felgenhauer, Aart Middeldorp, T. V. H. Prathamesh, and Franziska Rapp
Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, pp. 132 – 143, 2019

Cops and CoCoWeb: Infrastructure for Confluence Tools
Nao Hirokawa, Julian Nagele, and Aart Middeldorp
Proceedings of the 9th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence 10900, pp. 346 – 353, 2018

FORT 2.0
Franziska Rapp and Aart Middeldorp
Proceedings of the 9th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence 10900, pp. 81 – 88, 2018

Confluence Competition 2018
Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, and Harald Zankl
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, Leibniz International Proceedings in Informatics 108, pp. 32:1 – 32:5, 2018

ProTeM: A Proof Term Manipulator (System Description)
Christina Kohl and Aart Middeldorp
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, Leibniz International Proceedings in Informatics 108, pp. 31:1 – 31:8, 2018

Completion for Logically Constrained Rewriting
Sarah Winkler and Aart Middeldorp
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, Leibniz International Proceedings in Informatics 108, pp. 30:1 – 30:18, 2018

Towards a Verified Decision Procedure for Confluence of Ground Term Rewrite Systems in Isabelle/HOL
Bertram Felgenhauer, Aart Middeldorp, T. V. H. Prathamesh, and Franziska Rapp
Proceedings of the 7th International Workshop on Confluence, pp. 46 – 50, 2018

Constructing Cycles in the Simplex Method for DPLL(T)
Bertram Felgenhauer and Aart Middeldorp
Proceedings of the 14th International Colloquium on Theoretical Aspects of Computing, Lecture Notes in Computer Science 10580, pp. 213 – 228, 2017

Formalized Ground Completion
Aart Middeldorp and Christian Sternagel
Proceedings of the 6th International Workshop on Confluence, pp. 51 – 55, 2017

CoCoWeb — A Convenient Web Interface for Confluence Tools
Julian Nagele and Aart Middeldorp
Proceedings of the 6th International Workshop on Confluence, pp. 39 – 44, 2017

Infinite Runs in Abstract Completion
Nao Hirokawa, Aart Middeldorp, Christian Sternagel, and Sarah Winkler
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, Leibniz International Proceedings in Informatics 84, pp. 19:1 – 19:16, 2017

CSI: New Evidence — A Progress Report
Julian Nagele, Bertram Felgenhauer, and Aart Middeldorp
Proceedings of the 26th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 10395, pp. 385 – 397, 2017

Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems
Julian Nagele and Aart Middeldorp
Proceedings of the 7th International Conference on Interactive Theorem Proving, Lecture Notes in Computer Science 9807, pp. 290 – 306, 2016

Confluence Properties on Open Terms in the First-Order Theory of Rewriting
Franziska Rapp and Aart Middeldorp
Proceedings of the 5th International Workshop on Confluence, pp. 26 – 30, 2016

Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems
Franziska Rapp and Aart Middeldorp
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, Leibniz International Proceedings in Informatics 52, pp. 36:1 – 36:12, 2016

Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules
Julian Nagele, Bertram Felgenhauer, and Aart Middeldorp
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics 36, pp. 257 – 268, 2015

Conditional Complexity
Cynthia Kop, Aart Middeldorp, and Thomas Sternagel
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics 36, pp. 223 – 240, 2015

Leftmost Outermost Revisited
Nao Hirokawa, Aart Middeldorp, and Georg Moser
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics 36, pp. 209 – 222, 2015

Automating Elementary Interpretations
Harald Zankl, Sarah Winkler, and Aart Middeldorp
Proceedings of the 14th International Workshop on Termination, pp. 75 – 79, 2014

A New and Formalized Proof of Abstract Completion
Nao Hirokawa, Aart Middeldorp, and Christian Sternagel
Proceedings of the 5th International Conference on Interactive Theorem Proving, Lecture Notes in Computer Science 8558, pp. 292 – 307, 2014

Conditional Confluence (System Description)
Thomas Sternagel and Aart Middeldorp
Proceedings of the Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science 8620, pp. 456 – 465, 2014

AC–KBO Revisited
Akihisa Yamada, Sarah Winkler, Nao Hirokawa, and Aart Middeldorp
Proceedings of the 12th International Symposium on Functional and Logic Programming, Lecture Notes in Computer Science 8475, pp. 319 – 335, 2014

Commutation via Relative Termination
Nao Hirokawa and Aart Middeldorp
Proceedings of the 2nd International Workshop on Confluence, pp. 29 – 33, 2013

Beyond Peano Arithmetic — Automatically Proving Termination of the Goodstein Sequence
Sarah Winkler, Harald Zankl, and Aart Middeldorp
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics 21, pp. 335 – 351, 2013

Normalized Completion Revisited
Sarah Winkler and Aart Middeldorp
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics 21, pp. 319 – 334, 2013

Ordinals and Knuth-Bendix Orders
Sarah Winkler, Harald Zankl, and Aart Middeldorp
Proceedings of the 18th International Conference on Logic for Programming and Automated Reasoning, Lecture Notes in Computer Science (Advanced Research in Computing and Software Science) 7180, pp. 420 – 434, 2012

On the Domain and Dimension Hierarchy of Matrix Interpretations
Friedrich Neurauter and Aart Middeldorp
Proceedings of the 18th International Conference on Logic for Programming and Automated Reasoning, Lecture Notes in Computer Science (Advanced Research in Computing and Software Science) 7180, pp. 320 – 334, 2012

Layer Systems for Proving Confluence
Bertram Felgenhauer, Harald Zankl, and Aart Middeldorp
Proceedings of the 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Leibniz International Proceedings in Informatics 13, pp. 288 – 299, 2011

CSI — A Confluence Tool
Harald Zankl, Bertram Felgenhauer, and Aart Middeldorp
Proceedings of the 23rd International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 6803, pp. 499 – 505, 2011

AC Completion with Termination Tools
Sarah Winkler and Aart Middeldorp
Proceedings of the 23rd International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 6803, pp. 492 – 498, 2011

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, and Harald Zankl
Proceedings of the 4th International Conference on Algebraic Informatics, Lecture Notes in Computer Science 6742, pp. 1 – 20, 2011

Labelings for Decreasing Diagrams
Harald Zankl, Bertram Felgenhauer, and Aart Middeldorp
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics 10, pp. 377 – 392, 2011

Revisiting Matrix Interpretations for Proving Termination of Term Rewriting
Friedrich Neurauter and Aart Middeldorp
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics 10, pp. 251 – 266, 2011

Uncurrying for Innermost Termination and Derivational Complexity
Harald Zankl, Nao Hirokawa, and Aart Middeldorp
Proceedings of the 5th International Workshop on Higher-Order Rewriting, Electronic Proceedings in Theoretical Computer Science 49, pp. 46 – 57, 2011

Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
Friedrich Neurauter, Harald Zankl, and Aart Middeldorp
Proceedings of the 17th International Conference on Logic for Programming and Automated Reasoning, Lecture Notes in Computer Science (Advanced Research in Computing and Software Science) 6397, pp. 550 – 564, 2010

Termination Tools in Ordered Completion
Sarah Winkler and Aart Middeldorp
Proceedings of the 5th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence 6173, pp. 518 – 532, 2010

Monotonicity Criteria for Polynomial Interpretations over the Naturals
Friedrich Neurauter, Aart Middeldorp, and Harald Zankl
Proceedings of the 5th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence 6173, pp. 502 – 517, 2010

Decreasing Diagrams and Relative Termination
Nao Hirokawa and Aart Middeldorp
Proceedings of the 5th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence 6173, pp. 487 – 501, 2010

Optimizing mkbTT (System Description)
Sarah Winkler, Haruhiko Sato, Aart Middeldorp, and Masahito Kurihara
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics 6, pp. 373 – 384, 2010

Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Friedrich Neurauter and Aart Middeldorp
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, Leibniz International Proceedings in Informatics 6, pp. 243 – 258, 2010

Satisfiability of Non-Linear (Ir)rational Arithmetic
Harald Zankl and Aart Middeldorp
Proceedings of the 16th International Conference on Logic for Programming and Automated Reasoning, Lecture Notes in Artificial Intelligence 6355, pp. 481 – 500, 2010

Finding and Certifying Loops
Harald Zankl, Christian Sternagel, Dieter Hofbauer, and Aart Middeldorp
Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science 5901, pp. 755 – 766, 2010

Transforming SAT into Termination of Rewriting
Harald Zankl, Christian Sternagel, and Aart Middeldorp
Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming, Electronic Notes in Theoretical Computer Science 246, pp. 199 – 214, 2009

Beyond Dependency Graphs
Martin Korp and Aart Middeldorp
Proceedings of the 22nd International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 5663, pp. 339 – 354, 2009

Tyrolean Termination Tool 2
Martin Korp, Christian Sternagel, Harald Zankl, and Aart Middeldorp
Proceedings of the 20th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 5595, pp. 295 – 304, 2009

Uncurrying for Termination
Nao Hirokawa, Aart Middeldorp, and Harald Zankl
Proceedings of the 15th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning Reasoning, Lecture Notes in Artificial Intelligence 5330, pp. 667 – 681, 2008

Multi-Completion with Termination Tools (System Description)
Haruhiko Sato, Sarah Winkler, Masahito Kurihara, and Aart Middeldorp
Proceedings of the 4th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence 5195, pp. 306 – 312, 2008

Increasing Interpretations
Harald Zankl and Aart Middeldorp
Proceedings of the 9th International Conference on Artificial Intelligence and Symbolic Computation, Lecture Notes in Artificial Intelligence 5144, pp. 191 – 205, 2008

Root-Labeling
Christian Sternagel and Aart Middeldorp
Proceedings of the 19th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 5117, pp. 336 – 350, 2008

Maximal Termination
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, and Harald Zankl
Proceedings of the 19th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 5117, pp. 110 – 125, 2008

Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Martin Korp and Aart Middeldorp
Proceedings of the 2nd International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 5196, pp. 321 – 332, 2008

Innermost Termination of Rewrite Systems by Labeling
René Thiemann and Aart Middeldorp
Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, Electronic Notes in Theoretical Computer Science 204, pp. 3 – 19, 2008

Predictive Labeling with Dependency Pairs using SAT
Adam Koprowski and Aart Middeldorp
Proceedings of the 21st International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 4603, pp. 410 – 425, 2007

Proving Termination of Rewrite Systems using Bounds
Martin Korp and Aart Middeldorp
Proceedings of the 18th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 4533, pp. 273 – 287, 2007

Satisfying KBO Constraints
Harald Zankl and Aart Middeldorp
Proceedings of the 18th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 4533, pp. 389 – 403, 2007

SAT Solving for Termination Analysis with Polynomial Interpretations
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, and Harald Zankl
Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Computer Science 4501, pp. 340 – 254, 2007

Constraints for Argument Filterings
Harald Zankl, Nao Hirokawa, and Aart Middeldorp
Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science 4362, pp. 579 – 590, 2007

Predictive Labeling
Nao Hirokawa and Aart Middeldorp
Proceedings of the 17th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 4098, pp. 313 – 327, 2006

Uncurrying for Termination
Nao Hirokawa and Aart Middeldorp
Proceedings of the 3rd International Workshop on Higher-Order Rewriting, pp. 19 – 24, 2006

Tyrolean Termination Tool
Nao Hirokawa and Aart Middeldorp
Proceedings of the 16th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 3467, pp. 175 – 184, 2005

Polynomial Interpretations with Negative Coefficients
Nao Hirokawa and Aart Middeldorp
Proceedings of the 7th International Conference on Artificial Intelligence and Symbolic Mathematical Computation, Lecture Notes in Artificial Intelligence 3249, pp. 185 – 198, 2004

New Completeness Results for Lazy Conditional Narrowing
Mircea Marin and Aart Middeldorp
Proceedings of the 6th ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 120 – 131, 2004

Dependency Pairs Revisited
Nao Hirokawa and Aart Middeldorp
Proceedings of the 15th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 3091, pp. 249 – 268, 2004

Automating the Dependency Pair Method
Nao Hirokawa and Aart Middeldorp
Proceedings of the 19th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 2741, pp. 32 – 46, 2003

Tsukuba Termination Tool
Nao Hirokawa and Aart Middeldorp
Proceedings of the 14th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 2706, pp. 311 – 320, 2003

Innermost Termination of Context-Sensitive Rewriting
Jürgen Giesl and Aart Middeldorp
Proceedings of the 6th International Conference on Developments in Language Theory, Lecture Notes in Computer Science 2450, pp. 231 – 244, 2003

Approximations for Strategies and Termination
Aart Middeldorp
Proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming, Electronic Notes in Computer Science 70(6), pp. 1 – 20, 2002

Approximating Dependency Graphs using Tree Automata Techniques
Aart Middeldorp
Proceedings of the 1st International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence 2083, pp. 593 – 610, 2001

On the Modularity of Deciding Call-by-Need
Irène Durand and Aart Middeldorp
Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science 2030, pp. 199 – 213, 2001

A Complete Selection Function for Lazy Conditional Narrowing
Taro Suzuki and Aart Middeldorp
Proceedings of the 5th International Symposium on Functional and Logic Programming, Lecture Notes in Computer Science 2024, pp. 201 – 215, 2001

Equational Termination by Semantic Labelling
Hitoshi Ohsaki, Aart Middeldorp, and Jürgen Giesl
Proceedings of the 14th Annual Conference of the European Association for Computer Science Logic, Lecture Notes in Computer Science 1862, pp. 457 – 471, 2000

Eliminating Dummy Elimination
Jürgen Giesl and Aart Middeldorp
Proceedings of the 17th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 1831, pp. 309 – 323, 2000

Transforming Context-Sensitive Rewrite Systems
Jürgen Giesl and Aart Middeldorp
Proceedings of the 10th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 1631, pp. 271 – 285, 1999

Completeness Results for a Lazy Conditional Narrowing Calculus
Mohamed Hamada, Aart Middeldorp, and Taro Suzuki
Proceedings of the 2nd Discrete Mathematics and Theoretical Computer Science Conference and the 5th Australasian Theory Symposium, Springer-Verlag Singapore, pp. 217 – 231, 1999

Decidable Call by Need Computations in Term Rewriting (Extended Abstract)
Irène Durand and Aart Middeldorp
Proceedings of the 14th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 1249, pp. 4 – 18, 1997

Type Introduction for Equational Rewriting
Hitoshi Ohsaki and Aart Middeldorp
Proceedings of the 4th Symposium on Logical Foundations of Computer Science, Lecture Notes in Computer Science 1234, pp. 283 – 293, 1997

Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, and Hans Zantema
Proceedings of the 22nd Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science 1214, pp. 237 – 248, 1997

Logicality of Conditional Rewrite Systems
Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, and Aart Middeldorp
Proceedings of the 22nd Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science 1214, pp. 141 – 152, 1997

Call by Need Computations to Root-Stable Form
Aart Middeldorp
Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 94 – 105, 1997

Relative Undecidability in Term Rewriting
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, and Hans Zantema
Proceedings of the 10th Annual Conference of the European Association for Computer Science Logic, Lecture Notes in Computer Science 1258, pp. 150 – 166, 1997

Strong Completeness of a Lazy Conditional Narrowing Calculus
Mohamed Hamada and Aart Middeldorp
Proceedings of the 2nd Fuji International Workshop on Functional and Logic Programming, World Scientific, pp. 14 – 32, 1997

Transforming Termination by Self-Labelling
Aart Middeldorp, Hitoshi Ohsaki, and Hans Zantema
Proceedings of the 13th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 1104, pp. 373 – 387, 1996

A Deterministic Lazy Narrowing Calculus
Aart Middeldorp and Satoshi Okui
Proceedings of the Fuji International Workshop on Functional and Logic Programming, World Scientific, pp. 104 – 118, 1995

A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Koichi Nakahara, Aart Middeldorp, and Tetsuo Ida
Proceedings of the 7th International Symposium on Programming Languages, Implementations, Logics and Programs, Lecture Notes in Computer Science 982, pp. 97 – 114, 1995

Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract)
Satoshi Okui, Aart Middeldorp, and Tetsuo Ida
Proceedings of the 20th Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science 915, pp. 394 – 408, 1995

Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
Taro Suzuki, Aart Middeldorp, and Tetsuo Ida
Proceedings of the 6th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 914, pp. 179 – 193, 1995

A Sequential Reduction Strategy
Sergio Antoy and Aart Middeldorp
Proceedings of the 4th International Conference on Algebraic and Logic Programming, Lecture Notes in Computer Science 850, pp. 168 – 185, 1994

Simple Termination Revisited
Aart Middeldorp and Hans Zantema
Proceedings of the 12th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 814, pp. 451 – 465, 1994

Simple Termination is Difficult
Aart Middeldorp and Bernhard Gramlich
Proceedings of the 5th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 690, pp. 228 – 242, 1993

Completeness of Combinations of Conditional Constructor Systems
Aart Middeldorp
Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Lecture Notes in Computer Science 656, pp. 82 – 96, 1993

Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract)
Aart Middeldorp and Erik Hamoen
Proceedings of the 3rd International Conference on Algebraic and Logic Programming, Lecture Notes in Computer Science 632, pp. 244 – 258, 1992

Completeness of Combinations of Constructor Systems
Aart Middeldorp and Yoshihito Toyama
Proceedings of the 4th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 488, pp. 188 – 199, 1991

Confluence of the Disjoint Union of Conditional Term Rewriting Systems
Aart Middeldorp
Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting Systems, Lecture Notes in Computer Science 516, pp. 295 – 306, 1991

A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems
Aart Middeldorp
Proceedings of the 4th Annual Symposium on Logic in Computer Science, pp. 396 – 401, 1989

Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms
Aart Middeldorp
Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 355, pp. 263 – 277, 1989