Univ.-Prof. Dr. Aart Middeldorp   

Articles in Journals

Abstract Completion, Formalized
Nao Hirokawa, Aart Middeldorp, Christian Sternagel, and Sarah Winkler
Logical Methods in Computer Science 15(3), pp. 19:1 – 19:42, 2019

Complexity of Conditional Term Rewriting
Cynthia Kop, Aart Middeldorp, and Thomas Sternagel
Logical Methods in Computer Science 13(1:6), pp. 1 – 56, 2017

AC-KBO Revisited
Akihisa Yamada, Sarah Winkler, Nao Hirokawa, and Aart Middeldorp
Theory and Practice of Logic Programming 16(2), pp. 163 – 188, 2016

Layer Systems for Proving Confluence
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, and Vincent van Oostrom
ACM Transactions on Computational Logic 15(2:14), pp. 1 – 32, 2015

Beyond Polynomials and Peano Arithmetic – Automation of Elementary and Ordinal Interpretations
Harald Zankl, Sarah Winkler, and Aart Middeldorp
Journal of Symbolic Computation 69, pp. 129 – 158, 2015

Labelings for Decreasing Diagrams
Harald Zankl, Bertram Felgenhauer, and Aart Middeldorp
Journal of Automated Reasoning 54(2), pp. 101 – 133, 2015

Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited
Friedrich Neurauter and Aart Middeldorp
Logical Methods in Computer Science 10(3:22), pp. 1 – 28, 2014

Multi-Completion with Termination Tools
Sarah Winkler, Haruhiko Sato, Aart Middeldorp, and Masahito Kurihara
Journal of Automated Reasoning 50(3), pp. 317 – 354, 2013

Uncurrying for Termination and Complexity
Nao Hirokawa, Aart Middeldorp, and Harald Zankl
Journal of Automated Reasoning 50(3), pp. 279 – 315, 2013

Decreasing Diagrams and Relative Termination
Nao Hirokawa and Aart Middeldorp
Journal of Automated Reasoning 47(4), pp. 481 – 501, 2011

Increasing Interpretations
Harald Zankl and Aart Middeldorp
Annals of Mathematics and Artificial Intelligence 56(1), pp. 87 – 108, 2009

Match-Bounds Revisited
Martin Korp and Aart Middeldorp
Information and Computation 207(11), pp. 1259 – 1283, 2009

KBO Orientability
Harald Zankl, Nao Hirokawa, and Aart Middeldorp
Journal of Automated Reasoning 43(2), pp. 173 – 201, 2009

Constraint-Based Multi-Completion Procedures for Term Rewriting Systems
Haruhiko Sato, Masahito Kurihara, Sarah Winkler, and Aart Middeldorp
IEICI Transactions on Information and Systems E92-D(2), pp. 220 – 234, 2009

Tyrolean Termination Tool: Techniques and Features
Nao Hirokawa and Aart Middeldorp
Information and Computation 205(4), pp. 474 – 511, 2007

Automating the Dependency Pair Method
Nao Hirokawa and Aart Middeldorp
Information and Computation 199(1,2), pp. 172 – 199, 2005

Decidable Call-by-Need Computations in Term Rewriting
Irène Durand and Aart Middeldorp
Information and Computation 196(2), pp. 95 – 126, 2005

Transformation Techniques for Context-Sensitive Rewrite Systems
Jürgen Giesl and Aart Middeldorp
Journal of Functional Programming 14(4), pp. 379 – 427, 2004

Relative Undecidability in Term Rewriting, Part 2: The Confluence Hierarchy
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, and Hans Zantema
Information and Computation 178(1), pp. 132 – 148, 2002

Relative Undecidability in Term Rewriting, Part 1: The Termination Hierarchy
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, and Hans Zantema
Information and Computation 178(1), pp. 101 – 131, 2002

Complete Selection Functions for a Lazy Conditional Narrowing Calculus
Aart Middeldorp, Taro Suzuki, and Mohamed Hamada
Journal of Functional and Logic Programming 2002(3), 2002

Type Introduction for Equational Rewriting
Aart Middeldorp and Hitoshi Ohsaki
Acta Informatica 36(12), pp. 1007 – 1029, 2000

Logicality of Conditional Rewrite Systems
Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, and Aart Middeldorp
Theoretical Computer Science 236(1,2), pp. 209 – 232, 2000

A Deterministic Lazy Narrowing Calculus
Aart Middeldorp and Satoshi Okui
Journal of Symbolic Computation 25(6), pp. 733 – 757, 1998

Simple Termination of Rewrite Systems
Aart Middeldorp and Hans Zantema
Theoretical Computer Science 175(1), pp. 127 – 158, 1997

Lazy Narrowing: Strong Completeness and Eager Variable Elimination
Aart Middeldorp, Satoshi Okui, and Tetsuo Ida
Theoretical Computer Science 167(1,2), pp. 95 – 130, 1996

A Sequential Reduction Strategy
Sergio Antoy and Aart Middeldorp
Theoretical Computer Science 165(1), pp. 75 – 95, 1996

Simple Termination of Rewrite Systems
Aart Middeldorp and Hans Zantema
Bulletin of the Section of Logic 24(1), pp. 31 – 36, 1995

Simple Termination is Difficult
Aart Middeldorp and Bernhard Gramlich
Applicable Algebra in Engineering, Communication and Computing 6, pp. 115 – 128, 1995

Completeness of Combinations of Conditional Constructor Systems
Aart Middeldorp
Journal of Symbolic Computation 17, pp. 3 – 21, 1994

Completeness Results for Basic Narrowing
Aart Middeldorp and Erik Hamoen
Applicable Algebra in Engineering, Communication and Computing 5(3-4), pp. 213 – 253, 1994

Modularity of Confluence: A Simplified Proof
Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, and Roel de Vrijer
Information Processing Letters 49(2), pp. 101 – 109, 1994

Modular Properties of Conditional Term Rewriting Systems
Aart Middeldorp
Information and Computation 104(1), pp. 110 – 158, 1993

Completeness of Combinations of Constructor Systems
Aart Middeldorp
Journal of Symbolic Computation 15(3), pp. 331 – 348, 1993

Sequentiality in Orthogonal Term Rewriting Systems
Jan Willem Klop and Aart Middeldorp
Journal of Symbolic Computation 12(2), pp. 161 – 195, 1991