List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| scientific article; zbMATH DE number 7359428 (Why is no real title available?) | 2021-06-15 | Paper |
| Certified rule labeling | 2017-07-12 | Paper |
| Certifying confluence proofs via relative termination and rule labeling (available as arXiv preprint) | 2017-05-16 | Paper |
| Beyond Peano arithmetic -- automatically proving termination of the Goodstein sequence | 2017-02-01 | Paper |
| Confluence by decreasing diagrams -- formalized (available as arXiv preprint) | 2017-02-01 | Paper |
| Confluence Competition 2015 Automated Deduction - CADE-25 | 2015-12-02 | Paper |
| Layer systems for proving confluence ACM Transactions on Computational Logic | 2015-09-17 | Paper |
| Labelings for decreasing diagrams Journal of Automated Reasoning | 2015-07-02 | Paper |
| Transforming SAT into termination of rewriting Electronic Notes in Theoretical Computer Science | 2015-04-09 | Paper |
| Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations Journal of Symbolic Computation | 2015-01-14 | Paper |
| Modular complexity analysis for term rewriting Logical Methods in Computer Science | 2014-04-09 | Paper |
| Uncurrying for termination and complexity Journal of Automated Reasoning | 2013-07-05 | Paper |
| KBCV – Knuth-Bendix Completion Visualizer Automated Reasoning | 2012-09-05 | Paper |
| Layer systems for proving confluence | 2012-08-31 | Paper |
| Ordinals and Knuth-Bendix orders Logic for Programming, Artificial Intelligence, and Reasoning | 2012-06-15 | Paper |
| Modular complexity analysis via relative complexity | 2012-04-25 | Paper |
| Labelings for Decreasing Diagrams. | 2012-04-24 | Paper |
| Labelings for Decreasing Diagrams. (available as arXiv preprint) | 2012-04-24 | Paper |
| CSI -- a confluence tool Lecture Notes in Computer Science | 2011-07-29 | Paper |
| Joint spectral radius theory for automated complexity analysis of rewrite systems Algebraic Informatics | 2011-07-08 | Paper |
| Satisfiability of non-linear (ir)rational arithmetic Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
| Revisiting matrix interpretations for polynomial derivational complexity of term rewriting Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
| Monotonicity criteria for polynomial interpretations over the naturals Automated Reasoning | 2010-09-14 | Paper |
| KBO orientability Journal of Automated Reasoning | 2010-02-01 | Paper |
| Finding and certifying loops SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
| Increasing interpretations Annals of Mathematics and Artificial Intelligence | 2009-12-11 | Paper |
| SAT Solving for Termination Analysis with Polynomial Interpretations Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
| Uncurrying for Termination Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
| Increasing Interpretations Lecture Notes in Computer Science | 2009-01-27 | Paper |
| Maximal Termination Rewriting Techniques and Applications | 2008-08-28 | Paper |
| Constraints for Argument Filterings Lecture Notes in Computer Science | 2008-03-07 | Paper |
| Satisfying KBO Constraints Lecture Notes in Computer Science | 2008-01-02 | Paper |
Research outcomes over time
This page was built for person: Harald Zankl
