Aart Middeldorp

According to our database1, Aart Middeldorp
  • authored at least 125 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Preface: Selected Extended Papers of CADE 2015.
J. Autom. Reasoning, 2017

CoCoWeb - A Convenient Web Interface for Confluence Tools.
CoRR, 2017

Complexity of Conditional Term Rewriting.
Logical Methods in Computer Science, 2017

CSI: New Evidence - A Progress Report.
Proceedings of the Automated Deduction - CADE 26, 2017

2016
AC-KBO revisited.
TPLP, 2016

Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems.
Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

2015
Layer Systems for Proving Confluence.
ACM Trans. Comput. Log., 2015

Beyond polynomials and Peano arithmetic - automation of elementary and ordinal interpretations.
J. Symb. Comput., 2015

Labelings for Decreasing Diagrams.
J. Autom. Reasoning, 2015

Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Conditional Complexity.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Leftmost Outermost Revisited.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

2014
Labelings for Decreasing Diagrams.
CoRR, 2014

AC-KBO Revisited.
CoRR, 2014

Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited.
Logical Methods in Computer Science, 2014

Layer Systems for Proving Confluence.
CoRR, 2014

Conditional Confluence (System Description).
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

A New and Formalized Proof of Abstract Completion.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

AC-KBO Revisited.
Proceedings of the Functional and Logic Programming - 12th International Symposium, 2014

2013
Multi-Completion with Termination Tools.
J. Autom. Reasoning, 2013

Uncurrying for Termination and Complexity.
J. Autom. Reasoning, 2013

Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Normalized Completion Revisited.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012
Preface.
Theor. Comput. Sci., 2012

Ordinals and Knuth-Bendix Orders.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

On the Domain and Dimension Hierarchy of Matrix Interpretations.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

2011
Decreasing Diagrams and Relative Termination.
J. Autom. Reasoning, 2011

Labelings for Decreasing Diagrams.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Revisiting Matrix Interpretations for Proving Termination of Term Rewriting.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Layer Systems for Proving Confluence.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems.
Proceedings of the Algebraic Informatics - 4th International Conference, 2011

CSI - A Confluence Tool.
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

AC Completion with Termination Tools.
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

2010
Uncurrying for Innermost Termination and Derivational Complexity
Proceedings of the Proceedings 5th International Workshop on Higher-Order Rewriting, 2010

Finding and Certifying Loops.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Optimizing mkbTT.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Satisfiability of Non-linear (Ir)rational Arithmetic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Termination Tools in Ordered Completion.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

Monotonicity Criteria for Polynomial Interpretations over the Naturals.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

Decreasing Diagrams and Relative Termination.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2009
KBO Orientability.
J. Autom. Reasoning, 2009

Constraint-Based Multi-Completion Procedures for Term Rewriting Systems.
IEICE Transactions, 2009

Match-bounds revisited.
Inf. Comput., 2009

Transforming SAT into Termination of Rewriting.
Electr. Notes Theor. Comput. Sci., 2009

Preface.
Electr. Notes Theor. Comput. Sci., 2009

Decreasing Diagrams and Relative Termination
CoRR, 2009

On the Complexity of Deciding Call-by-Need
CoRR, 2009

Increasing interpretations.
Ann. Math. Artif. Intell., 2009

Tyrolean Termination Tool 2.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Beyond Dependency Graphs.
Proceedings of the Automated Deduction, 2009

2008
Innermost Termination of Rewrite Systems by Labeling.
Electr. Notes Theor. Comput. Sci., 2008

Root-Labeling.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Maximal Termination.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Uncurrying for Termination.
Proceedings of the Logic for Programming, 2008

Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems.
Proceedings of the Language and Automata Theory and Applications, 2008

Multi-completion with Termination Tools (System Description).
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

Increasing Interpretations.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007
Tyrolean termination tool: Techniques and features.
Inf. Comput., 2007

Constraints for Argument Filterings.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

SAT Solving for Termination Analysis with Polynomial Interpretations.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Satisfying KBO Constraints.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Proving Termination of Rewrite Systems Using Bounds.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Implementing RPO and POLO using SAT.
Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

Predictive Labeling with Dependency Pairs Using SAT.
Proceedings of the Automated Deduction, 2007

2006
Satisfying KBO Constraints
CoRR, 2006

Predictive Labeling.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005
Automating the dependency pair method.
Inf. Comput., 2005

Decidable call-by-need computations in term rewriting.
Inf. Comput., 2005

Tyrolean Termination Tool.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2004
Transformation techniques for context-sensitive rewrite systems.
J. Funct. Program., 2004

Dependency Pairs Revisited.
Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

New completeness results for lazy conditional narrowing.
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

Polynomial Interpretations with Negative Coefficients.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2004

2003
Preface.
Inf. Comput., 2003

Tsukuba Termination Tool.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

Automating the Dependency Pair Method.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
Complete Selection Functions for a Lazy Conditional Narrowing Calculus.
Journal of Functional and Logic Programming, 2002

Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy.
Inf. Comput., 2002

Relative Undecidability in Term Rewriting: I. The Termination Hierarchy.
Inf. Comput., 2002

Approximations for Strategies and Termination.
Electr. Notes Theor. Comput. Sci., 2002

Innermost Termination of Context-Sensitive Rewriting.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
On the Modularity of Deciding Call-by-Need.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

A Complete Selection Function for Lazy Conditional Narrowing.
Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

Approximating Dependency Graphs Using Tree Automata Techniques.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000
Logicality of conditional rewrite systems.
Theor. Comput. Sci., 2000

Type Introduction for Equational Rewriting.
Acta Inf., 2000

Equational Termination by Semantic Labelling.
Proceedings of the Computer Science Logic, 2000

Eliminating Dummy Elimination.
Proceedings of the Automated Deduction, 2000

1999
Transforming Context-Sensitive Rewrite Systems.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

Term Rewriting.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
A Deterministic Lazy Narrowing Calculus.
J. Symb. Comput., 1998

Strongly Sequential and Inductively Sequential Term Rewriting Systems.
Inf. Process. Lett., 1998

1997
Simple Termination of Rewrite Systems.
Theor. Comput. Sci., 1997

Logicality of Conditional Rewrite Systems.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Call by Need Computations to Root-Stable Form.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

Type Introduction for Equational Rewriting.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Decidable Call by Need Computations in term Rewriting (Extended Abstract).
Proceedings of the Automated Deduction, 1997

1996
Lazy Narrowing: Strong Completeness and Eager Variable Elimination.
Theor. Comput. Sci., 1996

A Sequential Reduction Strategy.
Theor. Comput. Sci., 1996

Relative Undecidability in Term Rewriting.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

Transforming Termination by Self-Labelling.
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995
Simple termination is difficult.
Appl. Algebra Eng. Commun. Comput., 1995

Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract).
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Proceedings of the Programming Languages: Implementations, 1995

1994
Completeness of Combinations of Conditional Constructor Systems.
J. Symb. Comput., 1994

Modularity of Confluence: A Simplified Proof.
Inf. Process. Lett., 1994

Completeness Results for Basic Narrowing.
Appl. Algebra Eng. Commun. Comput., 1994

Simple Termination Revisited.
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

A Sequential Reduction Strategy.
Proceedings of the Algebraic and Logic Programming, 4th International Conference, 1994

1993
Modular Properties of Conditional Term Rewriting Systems
Inf. Comput., May, 1993

Completeness of Combinations of Constructor Systems.
J. Symb. Comput., 1993

Simple Termination is Difficult.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

1992
Completeness of Combinations of Conditional Constructor Systems.
Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract).
Proceedings of the Algebraic and Logic Programming, 1992

1991
Sequentiality in Orthogonal Term Rewriting Systems.
J. Symb. Comput., 1991

Completeness of Combinations of Constructor Systems.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
Confluence of the Disjoint Union of Conditional Term Rewriting Systems.
Proceedings of the Conditional and Typed Rewriting Systems, 1990

1989
Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms.
Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989


  Loading...