Aart Middeldorp

174 papers A* 3A 23B 24C 4Misc 4Journal 59Unranked 51

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Unification of Deterministic Higher-Order Patterns. CoRR Johannes Niederhauser, Aart Middeldorp
2025	—	`conf`	Automated Analysis of Logically Constrained Rewrite Systems using crest. TACAS (1) Jonas Schöpf, Aart Middeldorp
2025	J	`jnl`	Automated Analysis of Logically Constrained Rewrite Systems using crest. CoRR Jonas Schöpf, Aart Middeldorp
2025	B	`conf`	Formalizing Simultaneous Critical Pairs for Confluence of Left-Linear Rewrite Systems. CPP Christina Kirk, Aart Middeldorp
2025	J	`jnl`	Hydra Battles and AC Termination. Log. Methods Comput. Sci. Nao Hirokawa, Aart Middeldorp
2025	J	`jnl`	Left-Linear Completion with AC Axioms. Log. Methods Comput. Sci. Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp
2025	J	`jnl`	The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version). CoRR Johannes Niederhauser, Aart Middeldorp
2025	A	`conf`	The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting. CADE Johannes Niederhauser, Aart Middeldorp
2024	—	`conf`	Confluence of Logically Constrained Rewrite Systems Revisited. IJCAR (2) Jonas Schöpf, Fabian Mitterwallner, Aart Middeldorp
2024	J	`jnl`	Confluence of Logically Constrained Rewrite Systems Revisited. CoRR Jonas Schöpf, Fabian Mitterwallner, Aart Middeldorp
2024	J	`jnl`	Left-Linear Completion with AC Axioms. CoRR Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp
2024	A*	`conf`	Linear Termination is Undecidable. LICS Fabian Mitterwallner, Aart Middeldorp, René Thiemann
2024	J	`jnl`	Undecidability Results on Orienting Single Rewrite Rules. Arch. Formal Proofs René Thiemann, Fabian Mitterwallner, Aart Middeldorp
2023	B	`conf`	A Formalization of the Development Closedness Criterion for Left-Linear Term Rewrite Systems. CPP Christina Kohl, Aart Middeldorp
2023	J	`jnl`	Confluence Criteria for Logically Constrained Rewrite Systems (Full Version). CoRR Jonas Schöpf, Aart Middeldorp
2023	A	`conf`	Confluence Criteria for Logically Constrained Rewrite Systems. CADE Jonas Schöpf, Aart Middeldorp
2023	J	`jnl`	First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification. J. Autom. Reason. Aart Middeldorp, Alexander Lochmann, Fabian Mitterwallner
2023	B	`conf`	Formalizing Almost Development Closed Critical Pairs (Short Paper). ITP Christina Kohl, Aart Middeldorp
2023	J	`jnl`	Hydra Battles and AC Termination, Revisited. CoRR Nao Hirokawa, Aart Middeldorp
2023	B	`conf`	Hydra Battles and AC Termination. FSCD Nao Hirokawa, Aart Middeldorp
2023	A	`conf`	Left-Linear Completion with AC Axioms. CADE Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp
2023	J	`jnl`	Linear Termination over N is Undecidable. CoRR Fabian Mitterwallner, Aart Middeldorp, René Thiemann
2022	B	`conf`	Polynomial Termination Over ℕ Is Undecidable. FSCD Fabian Mitterwallner, Aart Middeldorp
2021	B	`conf`	A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems. CPP Alexander Lochmann, Aart Middeldorp, Fabian Mitterwallner, Bertram Felgenhauer
2021	—	`conf`	Certifying Proofs in the First-Order Theory of Rewriting. TACAS (2) Fabian Mitterwallner, Alexander Lochmann, Aart Middeldorp, Bertram Felgenhauer
2021	J	`jnl`	CoCo 2019: report on the eighth confluence competition. Int. J. Softw. Tools Technol. Transf. Aart Middeldorp, Julian Nagele, Kiraku Shintani
2020	—	`conf`	Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting. TACAS (2) Alexander Lochmann, Aart Middeldorp
2019	B	`conf`	A verified ground confluence tool for linear variable-separated rewrite systems in Isabelle/HOL. CPP Bertram Felgenhauer, Aart Middeldorp, T. V. H. Prathamesh, Franziska Rapp
2019	J	`jnl`	Abstract Completion, Formalized. Log. Methods Comput. Sci. Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler
2019	A	`conf`	Composing Proof Terms. CADE Christina Kohl, Aart Middeldorp
2019	—	`conf`	Confluence Competition 2019. TACAS (3) Aart Middeldorp, Julian Nagele, Kiraku Shintani
2019	—	`conf`	Tools in Term Rewriting for Education. ThEdu@CADE Sarah Winkler, Aart Middeldorp
2018	J	`jnl`	Abstract Completion, Formalized. CoRR Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler
2018	B	`conf`	Completion for Logically Constrained Rewriting. FSCD Sarah Winkler, Aart Middeldorp
2018	B	`conf`	Confluence Competition 2018. FSCD Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl
2018	A	`conf`	Cops and CoCoWeb: Infrastructure for Confluence Tools. IJCAR Nao Hirokawa, Julian Nagele, Aart Middeldorp
2018	A	`conf`	FORT 2.0. IJCAR Franziska Rapp, Aart Middeldorp
2018	B	`conf`	ProTeM: A Proof Term Manipulator (System Description). FSCD Christina Kohl, Aart Middeldorp
2017	A	`conf`	CSI: New Evidence - A Progress Report. CADE Julian Nagele, Bertram Felgenhauer, Aart Middeldorp
2017	J	`jnl`	CoCoWeb - A Convenient Web Interface for Confluence Tools. CoRR Julian Nagele, Aart Middeldorp
2017	J	`jnl`	Complexity of Conditional Term Rewriting. Log. Methods Comput. Sci. Cynthia Kop, Aart Middeldorp, Thomas Sternagel
2017	C	`conf`	Constructing Cycles in the Simplex Method for DPLL(T). ICTAC Bertram Felgenhauer, Aart Middeldorp
2017	B	`conf`	Infinite Runs in Abstract Completion. FSCD Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler
2017	J	`jnl`	Preface: Selected Extended Papers of CADE 2015. J. Autom. Reason. Amy P. Felty, Aart Middeldorp
2016	J	`jnl`	AC-KBO revisited. Theory Pract. Log. Program. Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp
2016	B	`conf`	Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems. FSCD Franziska Rapp, Aart Middeldorp
2016	B	`conf`	Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems. ITP Julian Nagele, Aart Middeldorp
2015	A	`ed.`	Automated Deduction - CADE-25 - 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings CADE Amy P. Felty, Aart Middeldorp
2015	J	`jnl`	Beyond polynomials and Peano arithmetic - automation of elementary and ordinal interpretations. J. Symb. Comput. Harald Zankl, Sarah Winkler, Aart Middeldorp
2015	—	`conf`	Conditional Complexity. RTA Cynthia Kop, Aart Middeldorp, Thomas Sternagel
2015	—	`conf`	Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules. RTA Julian Nagele, Bertram Felgenhauer, Aart Middeldorp
2015	J	`jnl`	Labelings for Decreasing Diagrams. J. Autom. Reason. Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
2015	J	`jnl`	Layer Systems for Proving Confluence. ACM Trans. Comput. Log. Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
2015	—	`conf`	Leftmost Outermost Revisited. RTA Nao Hirokawa, Aart Middeldorp, Georg Moser
2015	—	`ed.`	Proceedings 8th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2014, Vienna, Austria, July 13, 2014. TERMGRAPH Aart Middeldorp, Femke van Raamsdonk
2014	B	`conf`	A New and Formalized Proof of Abstract Completion. ITP Nao Hirokawa, Aart Middeldorp, Christian Sternagel
2014	Misc	`conf`	AC-KBO Revisited. FLOPS Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp
2014	J	`jnl`	AC-KBO Revisited. CoRR Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp
2014	—	`conf`	Conditional Confluence (System Description). RTA-TLCA Thomas Sternagel, Aart Middeldorp
2014	—	`ed.`	LPAR 2013, 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, December 12-17, 2013, Stellenbosch, South Africa, Short papers proceedings LPAR (short papers) Kenneth L. McMillan, Aart Middeldorp, Geoff Sutcliffe, Andrei Voronkov
2014	J	`jnl`	Labelings for Decreasing Diagrams. CoRR Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
2014	J	`jnl`	Layer Systems for Proving Confluence. CoRR Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
2014	J	`jnl`	Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited. Log. Methods Comput. Sci. Friedrich Neurauter, Aart Middeldorp
2013	—	`conf`	Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence. RTA Sarah Winkler, Harald Zankl, Aart Middeldorp
2013	B	`ed.`	Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings LPAR Kenneth L. McMillan, Aart Middeldorp, Andrei Voronkov
2013	J	`jnl`	Multi-Completion with Termination Tools. J. Autom. Reason. Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara
2013	—	`conf`	Normalized Completion Revisited. RTA Sarah Winkler, Aart Middeldorp
2013	J	`jnl`	Uncurrying for Termination and Complexity. J. Autom. Reason. Nao Hirokawa, Aart Middeldorp, Harald Zankl
2012	B	`conf`	Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems. LPAR Aart Middeldorp
2012	B	`conf`	On the Domain and Dimension Hierarchy of Matrix Interpretations. LPAR Friedrich Neurauter, Aart Middeldorp
2012	B	`conf`	Ordinals and Knuth-Bendix Orders. LPAR Sarah Winkler, Harald Zankl, Aart Middeldorp
2012	J	`jnl`	Preface. Theor. Comput. Sci. Takahito Aoto, Aart Middeldorp
2011	A	`conf`	AC Completion with Termination Tools. CADE Sarah Winkler, Aart Middeldorp
2011	A	`conf`	CSI - A Confluence Tool. CADE Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
2011	J	`jnl`	Decreasing Diagrams and Relative Termination. J. Autom. Reason. Nao Hirokawa, Aart Middeldorp
2011	—	`conf`	Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl
2011	—	`conf`	Labelings for Decreasing Diagrams. RTA Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
2011	—	`conf`	Layer Systems for Proving Confluence. FSTTCS Bertram Felgenhauer, Harald Zankl, Aart Middeldorp
2011	—	`conf`	Revisiting Matrix Interpretations for Proving Termination of Term Rewriting. RTA Friedrich Neurauter, Aart Middeldorp
2010	A	`conf`	Decreasing Diagrams and Relative Termination. IJCAR Nao Hirokawa, Aart Middeldorp
2010	B	`conf`	Finding and Certifying Loops. SOFSEM Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp
2010	A	`conf`	Monotonicity Criteria for Polynomial Interpretations over the Naturals. IJCAR Friedrich Neurauter, Aart Middeldorp, Harald Zankl
2010	—	`conf`	Optimizing mkbTT. RTA Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara
2010	—	`conf`	Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers. RTA Friedrich Neurauter, Aart Middeldorp
2010	—	`conf`	Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. LPAR (Yogyakarta) Friedrich Neurauter, Harald Zankl, Aart Middeldorp
2010	—	`conf`	Satisfiability of Non-linear (Ir)rational Arithmetic. LPAR (Dakar) Harald Zankl, Aart Middeldorp
2010	A	`conf`	Termination Tools in Ordered Completion. IJCAR Sarah Winkler, Aart Middeldorp
2010	—	`conf`	Uncurrying for Innermost Termination and Derivational Complexity HOR Harald Zankl, Nao Hirokawa, Aart Middeldorp
2009	A	`conf`	Beyond Dependency Graphs. CADE Martin Korp, Aart Middeldorp
2009	J	`jnl`	Constraint-Based Multi-Completion Procedures for Term Rewriting Systems. IEICE Trans. Inf. Syst. Haruhiko Sato, Masahito Kurihara, Sarah Winkler, Aart Middeldorp
2009	J	`jnl`	Decreasing Diagrams and Relative Termination CoRR Nao Hirokawa, Aart Middeldorp
2009	J	`jnl`	Increasing interpretations. Ann. Math. Artif. Intell. Harald Zankl, Aart Middeldorp
2009	J	`jnl`	KBO Orientability. J. Autom. Reason. Harald Zankl, Nao Hirokawa, Aart Middeldorp
2009	J	`jnl`	Match-bounds revisited. Inf. Comput. Martin Korp, Aart Middeldorp
2009	J	`jnl`	On the Complexity of Deciding Call-by-Need CoRR Irène Durand, Aart Middeldorp
2009	—	`ed.`	Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, WRS@RTA 2008, Hagenberg, Austria, July 14, 2008 WRS@RTA Aart Middeldorp
2009	—	`conf`	Tyrolean Termination Tool 2. RTA Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp
2008	—	`conf`	Increasing Interpretations. AISC/MKM/Calculemus Harald Zankl, Aart Middeldorp
2008	C	`conf`	Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. LATA Martin Korp, Aart Middeldorp
2008	—	`conf`	Maximal Termination. RTA Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
2008	A	`conf`	Multi-completion with Termination Tools (System Description). IJCAR Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp
2008	—	`conf`	Preface. WRS@RTA Aart Middeldorp
2008	—	`conf`	Root-Labeling. RTA Christian Sternagel, Aart Middeldorp
2008	—	`conf`	Transforming SAT into Termination of Rewriting. WFLP Harald Zankl, Christian Sternagel, Aart Middeldorp
2008	B	`conf`	Uncurrying for Termination. LPAR Nao Hirokawa, Aart Middeldorp, Harald Zankl
2007	—	`conf`	Constraints for Argument Filterings. SOFSEM (1) Harald Zankl, Nao Hirokawa, Aart Middeldorp
2007	—	`conf`	Implementing RPO and POLO using SAT. Deduction and Decision Procedures Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl
2007	—	`conf`	Innermost Termination of Rewrite Systems by Labeling. WRS@RDP René Thiemann, Aart Middeldorp
2007	A	`conf`	Predictive Labeling with Dependency Pairs Using SAT. CADE Adam Koprowski, Aart Middeldorp
2007	—	`conf`	Proving Termination of Rewrite Systems Using Bounds. RTA Martin Korp, Aart Middeldorp
2007	A	`conf`	SAT Solving for Termination Analysis with Polynomial Interpretations. SAT Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
2007	—	`conf`	Satisfying KBO Constraints. RTA Harald Zankl, Aart Middeldorp
2007	J	`jnl`	Tyrolean termination tool: Techniques and features. Inf. Comput. Nao Hirokawa, Aart Middeldorp
2006	—	`conf`	Predictive Labeling. RTA Nao Hirokawa, Aart Middeldorp
2006	J	`jnl`	Satisfying KBO Constraints CoRR Harald Zankl, Aart Middeldorp
2005	J	`jnl`	Automating the dependency pair method. Inf. Comput. Nao Hirokawa, Aart Middeldorp
2005	J	`jnl`	Decidable call-by-need computations in term rewriting. Inf. Comput. Irène Durand, Aart Middeldorp
2005	—	`ed.`	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 Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel C. de Vrijer
2005	—	`conf`	Tyrolean Termination Tool. RTA Nao Hirokawa, Aart Middeldorp
2004	—	`conf`	Dependency Pairs Revisited. RTA Nao Hirokawa, Aart Middeldorp
2004	C	`conf`	New completeness results for lazy conditional narrowing. PPDP Mircea Marin, Aart Middeldorp
2004	Misc	`conf`	Polynomial Interpretations with Negative Coefficients. AISC Nao Hirokawa, Aart Middeldorp
2004	J	`jnl`	Transformation techniques for context-sensitive rewrite systems. J. Funct. Program. Jürgen Giesl, Aart Middeldorp
2003	A	`conf`	Automating the Dependency Pair Method. CADE Nao Hirokawa, Aart Middeldorp
2003	J	`jnl`	Preface. Inf. Comput. Aart Middeldorp
2003	—	`conf`	Tsukuba Termination Tool. RTA Nao Hirokawa, Aart Middeldorp
2002	—	`conf`	Approximations for Strategies and Termination. WRS Aart Middeldorp
2002	J	`jnl`	Complete Selection Functions for a Lazy Conditional Narrowing Calculus. J. Funct. Log. Program. Aart Middeldorp, Taro Suzuki, Mohamed Hamada
2002	C	`conf`	Innermost Termination of Context-Sensitive Rewriting. Developments in Language Theory Jürgen Giesl, Aart Middeldorp
2002	J	`jnl`	Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
2002	J	`jnl`	Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
2001	Misc	`conf`	A Complete Selection Function for Lazy Conditional Narrowing. FLOPS Taro Suzuki, Aart Middeldorp
2001	A	`conf`	Approximating Dependency Graphs Using Tree Automata Techniques. IJCAR Aart Middeldorp
2001	B	`conf`	On the Modularity of Deciding Call-by-Need. FoSSaCS Irène Durand, Aart Middeldorp
2001	—	`ed.`	Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings RTA Aart Middeldorp
2000	A	`conf`	Eliminating Dummy Elimination. CADE Jürgen Giesl, Aart Middeldorp
2000	B	`conf`	Equational Termination by Semantic Labelling. CSL Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl
2000	J	`jnl`	Logicality of conditional rewrite systems. Theor. Comput. Sci. Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
2000	J	`jnl`	Type Introduction for Equational Rewriting. Acta Informatica Aart Middeldorp, Hitoshi Ohsaki
1999	—	`ed.`	Functional and Logic Programming, 4th Fuji International Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999, Proceedings FLOPS Aart Middeldorp, Taisuke Sato
1999	B	`conf`	Term Rewriting. CSL Aart Middeldorp
1999	—	`conf`	Transforming Context-Sensitive Rewrite Systems. RTA Jürgen Giesl, Aart Middeldorp
1998	J	`jnl`	A Deterministic Lazy Narrowing Calculus. J. Symb. Comput. Aart Middeldorp, Satoshi Okui
1998	J	`jnl`	Strongly Sequential and Inductively Sequential Term Rewriting Systems. Inf. Process. Lett. Michael Hanus, Salvador Lucas, Aart Middeldorp
1997	A*	`conf`	Call by Need Computations to Root-Stable Form. POPL Aart Middeldorp
1997	A	`conf`	Decidable Call by Need Computations in term Rewriting (Extended Abstract). CADE Irène Durand, Aart Middeldorp
1997	—	`conf`	Logicality of Conditional Rewrite Systems. TAPSOFT Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
1997	—	`conf`	Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
1997	J	`jnl`	Simple Termination of Rewrite Systems. Theor. Comput. Sci. Aart Middeldorp, Hans Zantema
1997	Misc	`conf`	Type Introduction for Equational Rewriting. LFCS Hitoshi Ohsaki, Aart Middeldorp
1996	J	`jnl`	A Sequential Reduction Strategy. Theor. Comput. Sci. Sergio Antoy, Aart Middeldorp
1996	J	`jnl`	Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theor. Comput. Sci. Aart Middeldorp, Satoshi Okui, Tetsuo Ida
1996	B	`conf`	Relative Undecidability in Term Rewriting. CSL Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
1996	A	`conf`	Transforming Termination by Self-Labelling. CADE Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema
1995	—	`conf`	A Complete Narrowing Calculus for Higher-Order Functional Logic Programming PLILP Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
1995	—	`conf`	Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). TAPSOFT Satoshi Okui, Aart Middeldorp, Tetsuo Ida
1995	—	`conf`	Lazy Narrowing: Strong Completeness and Eager Variable Elimination. UNIF Aart Middeldorp, Satoshi Okui, Tetsuo Ida
1995	—	`conf`	Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. RTA Taro Suzuki, Aart Middeldorp, Tetsuo Ida
1995	J	`jnl`	Simple termination is difficult. Appl. Algebra Eng. Commun. Comput. Aart Middeldorp, Bernhard Gramlich
1994	—	`conf`	A Sequential Reduction Strategy. ALP Sergio Antoy, Aart Middeldorp
1994	J	`jnl`	Completeness Results for Basic Narrowing. Appl. Algebra Eng. Commun. Comput. Aart Middeldorp, Erik Hamoen
1994	J	`jnl`	Completeness of Combinations of Conditional Constructor Systems. J. Symb. Comput. Aart Middeldorp
1994	J	`jnl`	Modularity of Confluence: A Simplified Proof. Inf. Process. Lett. Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer
1994	A	`conf`	Simple Termination Revisited. CADE Aart Middeldorp, Hans Zantema
1993	J	`jnl`	Completeness of Combinations of Constructor Systems. J. Symb. Comput. Aart Middeldorp, Yoshihito Toyama
1993	J	`jnl`	Modular Properties of Conditional Term Rewriting Systems Inf. Comput. Aart Middeldorp
1993	—	`conf`	Simple Termination is Difficult. RTA Aart Middeldorp, Bernhard Gramlich
1992	—	`conf`	Completeness of Combinations of Conditional Constructor Systems. CTRS Aart Middeldorp
1992	—	`conf`	Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract). ALP Aart Middeldorp, Erik Hamoen
1991	—	`conf`	Completeness of Combinations of Constructor Systems. RTA Aart Middeldorp, Yoshihito Toyama
1991	J	`jnl`	Sequentiality in Orthogonal Term Rewriting Systems. J. Symb. Comput. Jan Willem Klop, Aart Middeldorp
1990	—	`conf`	Confluence of the Disjoint Union of Conditional Term Rewriting Systems. CTRS Aart Middeldorp
1989	A*	`conf`	A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems LICS Aart Middeldorp
1989	—	`conf`	Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms. RTA Aart Middeldorp