Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAart Middeldorp
Person information
- affiliation: University of Innsbruck, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
[j41]Cynthia Kop, Aart Middeldorp, Thomas Sternagel:
Complexity of Conditional Term Rewriting. Logical Methods in Computer Science 13(1) (2017)- [j40]Amy P. Felty, Aart Middeldorp:
Preface: Selected Extended Papers of CADE 2015. J. Autom. Reasoning 58(3): 311-312 (2017) - [c78]Julian Nagele, Bertram Felgenhauer, Aart Middeldorp:
CSI: New Evidence - A Progress Report. CADE 2017: 385-397 - [c77]Bertram Felgenhauer, Aart Middeldorp:
Constructing Cycles in the Simplex Method for DPLL(T). ICTAC 2017: 213-228 - [c76]Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler:
Infinite Runs in Abstract Completion. FSCD 2017: 19:1-19:16 - [i8]Julian Nagele, Aart Middeldorp:
CoCoWeb - A Convenient Web Interface for Confluence Tools. CoRR abs/1708.07876 (2017) - 2016
- [j39]Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp:
AC-KBO revisited. TPLP 16(2): 163-188 (2016) - [c75]Julian Nagele, Aart Middeldorp:
Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems. ITP 2016: 290-306 - [c74]Franziska Rapp, Aart Middeldorp:
Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems. FSCD 2016: 36:1-36:12 - 2015
- [j38]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp:
Labelings for Decreasing Diagrams. J. Autom. Reasoning 54(2): 101-133 (2015) - [j37]Harald Zankl, Sarah Winkler, Aart Middeldorp:
Beyond polynomials and Peano arithmetic - automation of elementary and ordinal interpretations. J. Symb. Comput. 69: 129-158 (2015) - [j36]Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom:
Layer Systems for Proving Confluence. ACM Trans. Comput. Log. 16(2): 14:1-14:32 (2015) - [c73]
- [c72]
- [c71]Julian Nagele, Bertram Felgenhauer, Aart Middeldorp:
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules. RTA 2015: 257-268 - [e7]Amy P. Felty, Aart Middeldorp:
Automated Deduction - CADE-25 - 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings. Lecture Notes in Computer Science 9195, Springer 2015, ISBN 978-3-319-21400-9 [contents] - [e6]Aart Middeldorp, Femke van Raamsdonk:
Proceedings 8th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2014, Vienna, Austria, July 13, 2014. EPTCS 183, 2015 [contents] - 2014
- [j35]Friedrich Neurauter, Aart Middeldorp:
Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited. Logical Methods in Computer Science 10(3) (2014) - [c70]
- [c69]Nao Hirokawa, Aart Middeldorp, Christian Sternagel:
A New and Formalized Proof of Abstract Completion. ITP 2014: 292-307 - [c68]Thomas Sternagel, Aart Middeldorp:
Conditional Confluence (System Description). RTA-TLCA 2014: 456-465 - [e5]Kenneth L. McMillan, Aart Middeldorp, Geoff Sutcliffe, Andrei Voronkov:
LPAR 2013, 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, December 12-17, 2013, Stellenbosch, South Africa, Short papers proceedings. EPiC Series in Computing 26, EasyChair 2014 [contents] - [i7]Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp:
AC-KBO Revisited. CoRR abs/1403.0406 (2014) - [i6]Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom:
Layer Systems for Proving Confluence. CoRR abs/1404.1225 (2014) - [i5]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp:
Labelings for Decreasing Diagrams. CoRR abs/1406.3139 (2014) - 2013
- [j34]Nao Hirokawa, Aart Middeldorp, Harald Zankl:
Uncurrying for Termination and Complexity. J. Autom. Reasoning 50(3): 279-315 (2013) - [j33]Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara:
Multi-Completion with Termination Tools. J. Autom. Reasoning 50(3): 317-354 (2013) - [c67]
- [c66]Sarah Winkler, Harald Zankl, Aart Middeldorp:
Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence. RTA 2013: 335-351 - [e4]Kenneth L. McMillan, Aart Middeldorp, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings. Lecture Notes in Computer Science 8312, Springer 2013, ISBN 978-3-642-45220-8 [contents] - 2012
- [j32]
- [c65]Aart Middeldorp:
Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems. LPAR 2012: 12 - [c64]Friedrich Neurauter, Aart Middeldorp:
On the Domain and Dimension Hierarchy of Matrix Interpretations. LPAR 2012: 320-334 - [c63]
- 2011
- [j31]Nao Hirokawa, Aart Middeldorp:
Decreasing Diagrams and Relative Termination. J. Autom. Reasoning 47(4): 481-501 (2011) - [c62]
- [c61]
- [c60]Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl:
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI 2011: 1-20 - [c59]Bertram Felgenhauer, Harald Zankl, Aart Middeldorp:
Layer Systems for Proving Confluence. FSTTCS 2011: 288-299 - [c58]Friedrich Neurauter, Aart Middeldorp:
Revisiting Matrix Interpretations for Proving Termination of Term Rewriting. RTA 2011: 251-266 - [c57]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp:
Labelings for Decreasing Diagrams. RTA 2011: 377-392 - 2010
- [c56]
- [c55]Friedrich Neurauter, Aart Middeldorp, Harald Zankl:
Monotonicity Criteria for Polynomial Interpretations over the Naturals. IJCAR 2010: 502-517 - [c54]
- [c53]Harald Zankl, Aart Middeldorp:
Satisfiability of Non-linear (Ir)rational Arithmetic. LPAR (Dakar) 2010: 481-500 - [c52]Friedrich Neurauter, Harald Zankl, Aart Middeldorp:
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. LPAR (Yogyakarta) 2010: 550-564 - [c51]Friedrich Neurauter, Aart Middeldorp:
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers. RTA 2010: 243-258 - [c50]Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara:
Optimizing mkbTT. RTA 2010: 373-384 - [c49]Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp:
Finding and Certifying Loops. SOFSEM 2010: 755-766 - [c48]Harald Zankl, Nao Hirokawa, Aart Middeldorp:
Uncurrying for Innermost Termination and Derivational Complexity. HOR 2010: 46-57
2000 – 2009
- 2009
- [j30]Harald Zankl, Aart Middeldorp:
Increasing interpretations. Ann. Math. Artif. Intell. 56(1): 87-108 (2009) - [j29]
- [j28]Harald Zankl, Christian Sternagel, Aart Middeldorp:
Transforming SAT into Termination of Rewriting. Electr. Notes Theor. Comput. Sci. 246: 199-214 (2009) - [j27]
- [j26]Haruhiko Sato, Masahito Kurihara, Sarah Winkler, Aart Middeldorp:
Constraint-Based Multi-Completion Procedures for Term Rewriting Systems. IEICE Transactions 92-D(2): 220-234 (2009) - [j25]Harald Zankl, Nao Hirokawa, Aart Middeldorp:
KBO Orientability. J. Autom. Reasoning 43(2): 173-201 (2009) - [c47]
- [c46]Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp:
Tyrolean Termination Tool 2. RTA 2009: 295-304 - [i4]Irène Durand, Aart Middeldorp:
On the Complexity of Deciding Call-by-Need. CoRR abs/0901.0869 (2009) - [i3]Nao Hirokawa, Aart Middeldorp:
Decreasing Diagrams and Relative Termination. CoRR abs/0910.2853 (2009) - 2008
- [j24]René Thiemann, Aart Middeldorp:
Innermost Termination of Rewrite Systems by Labeling. Electr. Notes Theor. Comput. Sci. 204: 3-19 (2008) - [c45]
- [c44]Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp:
Multi-completion with Termination Tools (System Description). IJCAR 2008: 306-312 - [c43]Martin Korp, Aart Middeldorp:
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. LATA 2008: 321-332 - [c42]
- [c41]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
Maximal Termination. RTA 2008: 110-125 - [c40]
- 2007
- [j23]Nao Hirokawa, Aart Middeldorp:
Tyrolean termination tool: Techniques and features. Inf. Comput. 205(4): 474-511 (2007) - [c39]Adam Koprowski, Aart Middeldorp:
Predictive Labeling with Dependency Pairs Using SAT. CADE 2007: 410-425 - [c38]Martin Korp, Aart Middeldorp:
Proving Termination of Rewrite Systems Using Bounds. RTA 2007: 273-287 - [c37]
- [c36]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354 - [c35]Harald Zankl, Nao Hirokawa, Aart Middeldorp:
Constraints for Argument Filterings. SOFSEM (1) 2007: 579-590 - [i2]Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl:
Implementing RPO and POLO using SAT. Deduction and Decision Procedures 2007 - 2006
- [c34]
- [i1]
- 2005
- [j22]Irène Durand, Aart Middeldorp:
Decidable call-by-need computations in term rewriting. Inf. Comput. 196(2): 95-126 (2005) - [j21]Nao Hirokawa, Aart Middeldorp:
Automating the dependency pair method. Inf. Comput. 199(1-2): 172-199 (2005) - [c33]
- [e3]Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel C. de Vrijer:
Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 3838, Springer 2005, ISBN 3-540-30911-X [contents] - 2004
- [j20]Jürgen Giesl, Aart Middeldorp:
Transformation techniques for context-sensitive rewrite systems. J. Funct. Program. 14(4): 379-427 (2004) - [c32]Nao Hirokawa, Aart Middeldorp:
Polynomial Interpretations with Negative Coefficients. AISC 2004: 185-198 - [c31]Mircea Marin, Aart Middeldorp:
New completeness results for lazy conditional narrowing. PPDP 2004: 120-131 - [c30]
- 2003
- [j19]
- [c29]
- [c28]
- 2002
- [j18]Aart Middeldorp:
Approximations for Strategies and Termination. Electr. Notes Theor. Comput. Sci. 70(6): 1-20 (2002) - [j17]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002) - [j16]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002) - [j15]Aart Middeldorp, Taro Suzuki, Mohamed Hamada:
Complete Selection Functions for a Lazy Conditional Narrowing Calculus. Journal of Functional and Logic Programming 2002 (2002) - [c27]Jürgen Giesl, Aart Middeldorp:
Innermost Termination of Context-Sensitive Rewriting. Developments in Language Theory 2002: 231-244 - 2001
- [c26]Aart Middeldorp:
Approximating Dependency Graphs Using Tree Automata Techniques. IJCAR 2001: 593-610 - [c25]Taro Suzuki, Aart Middeldorp:
A Complete Selection Function for Lazy Conditional Narrowing. FLOPS 2001: 201-215 - [c24]
- [e2]Aart Middeldorp:
Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings. Lecture Notes in Computer Science 2051, Springer 2001, ISBN 3-540-42117-3 [contents] - 2000
- [j14]Aart Middeldorp, Hitoshi Ohsaki:
Type Introduction for Equational Rewriting. Acta Inf. 36(12): 1007-1029 (2000) - [j13]Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp:
Logicality of conditional rewrite systems. Theor. Comput. Sci. 236(1-2): 209-232 (2000) - [c23]
- [c22]Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl:
Equational Termination by Semantic Labelling. CSL 2000: 457-471
1990 – 1999
- 1999
- [c21]
- [c20]
- [e1]Aart Middeldorp, Taisuke Sato:
Functional and Logic Programming, 4th Fuji International Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999, Proceedings. Lecture Notes in Computer Science 1722, Springer 1999, ISBN 3-540-66677-X [contents] - 1998
- [j12]Michael Hanus, Salvador Lucas, Aart Middeldorp:
Strongly Sequential and Inductively Sequential Term Rewriting Systems. Inf. Process. Lett. 67(1): 1-8 (1998) - [j11]Aart Middeldorp, Satoshi Okui:
A Deterministic Lazy Narrowing Calculus. J. Symb. Comput. 25(6): 733-757 (1998) - 1997
- [j10]Aart Middeldorp, Hans Zantema:
Simple Termination of Rewrite Systems. Theor. Comput. Sci. 175(1): 127-158 (1997) - [c19]Irène Durand, Aart Middeldorp:
Decidable Call by Need Computations in term Rewriting (Extended Abstract). CADE 1997: 4-18 - [c18]
- [c17]
- [c16]Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp:
Logicality of Conditional Rewrite Systems. TAPSOFT 1997: 141-152 - [c15]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248 - 1996
- [j9]Sergio Antoy, Aart Middeldorp:
A Sequential Reduction Strategy. Theor. Comput. Sci. 165(1): 75-95 (1996) - [j8]Aart Middeldorp, Satoshi Okui, Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theor. Comput. Sci. 167(1&2): 95-130 (1996) - [c14]Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema:
Transforming Termination by Self-Labelling. CADE 1996: 373-387 - [c13]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting. CSL 1996: 150-166 - 1995
- [j7]Aart Middeldorp, Bernhard Gramlich:
Simple termination is difficult. Appl. Algebra Eng. Commun. Comput. 6: 115-128 (1995) - [c12]Koichi Nakahara, Aart Middeldorp, Tetsuo Ida:
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming. PLILP 1995: 97-114 - [c11]Taro Suzuki, Aart Middeldorp, Tetsuo Ida:
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. RTA 1995: 179-193 - [c10]Satoshi Okui, Aart Middeldorp, Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). TAPSOFT 1995: 394-408 - 1994
- [j6]Aart Middeldorp, Erik Hamoen:
Completeness Results for Basic Narrowing. Appl. Algebra Eng. Commun. Comput. 5: 213-253 (1994) - [j5]Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer:
Modularity of Confluence: A Simplified Proof. Inf. Process. Lett. 49(2): 101-109 (1994) - [j4]Aart Middeldorp:
Completeness of Combinations of Conditional Constructor Systems. J. Symb. Comput. 17(1): 3-21 (1994) - [c9]
- [c8]
- 1993
- [j3]Aart Middeldorp:
Modular Properties of Conditional Term Rewriting Systems. Inf. Comput. 104(1): 110-158 (1993) - [j2]Aart Middeldorp, Yoshihito Toyama:
Completeness of Combinations of Constructor Systems. J. Symb. Comput. 15(3): 331-348 (1993) - [c7]
- 1992
- [c6]Aart Middeldorp, Erik Hamoen:
Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract). ALP 1992: 244-258 - [c5]
- 1991
- [j1]Jan Willem Klop, Aart Middeldorp:
Sequentiality in Orthogonal Term Rewriting Systems. J. Symb. Comput. 12(2): 161-196 (1991) - [c4]Aart Middeldorp, Yoshihito Toyama:
Completeness of Combinations of Constructor Systems. RTA 1991: 188-199 - 1990
- [c3]Aart Middeldorp:
Confluence of the Disjoint Union of Conditional Term Rewriting Systems. CTRS 1990: 295-306
1980 – 1989
- 1989
- [c2]Aart Middeldorp:
A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems. LICS 1989: 396-401 - [c1]