publications: - title: "Minimizing Sums of Addition Chains" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1991" researchr: "https://researchr.org/publication/Zantema91" cites: 0 citedby: 0 journal: "jal" volume: "12" number: "2" pages: "281-307" kind: "article" key: "Zantema91" - title: "Normalization of Infinite Terms" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2008" doi: "http://dx.doi.org/10.1007/978-3-540-70590-1_30" links: doi: "http://dx.doi.org/10.1007/978-3-540-70590-1_30" researchr: "https://researchr.org/publication/Zantema08" cites: 0 citedby: 0 pages: "441-455" booktitle: "RTA" kind: "inproceedings" key: "Zantema08" - title: "Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models" author: - name: "Matthias Raffelsieper" link: "https://researchr.org/alias/matthias-raffelsieper" - name: "Mohammad Reza Mousavi" link: "https://researchr.org/alias/mohammad-reza-mousavi" - name: "Jan-Willem Roorda" link: "https://researchr.org/alias/jan-willem-roorda" - name: "Chris W. H. Strolenberg" link: "https://researchr.org/alias/chris-w.-h.-strolenberg" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2009" doi: "http://dx.doi.org/10.1007/978-3-642-04570-7_11" links: doi: "http://dx.doi.org/10.1007/978-3-642-04570-7_11" tags: - "analysis" researchr: "https://researchr.org/publication/RaffelsieperMRSZ09" cites: 0 citedby: 0 pages: "133-148" booktitle: "fmics" kind: "inproceedings" key: "RaffelsieperMRSZ09" - title: "TORPA: Termination of Rewriting Proved Automatically" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2004" doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3091&spage=95" links: doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3091&spage=95" tags: - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/Zantema04" cites: 0 citedby: 0 pages: "95-104" booktitle: "RTA" kind: "inproceedings" key: "Zantema04" - title: "Finding Small Equivalent Decision Trees is Hard" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" - name: "Hans Leo Bodlaender" link: "http://people.cs.uu.nl/hansb/" year: "2000" researchr: "https://researchr.org/publication/ZantemaB00" cites: 0 citedby: 0 journal: "ijfcs" volume: "11" number: "2" pages: "343-354" kind: "article" key: "ZantemaB00" - title: "Termination by Quasi-periodic Interpretations" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" - name: "Johannes Waldmann" link: "https://researchr.org/alias/johannes-waldmann" year: "2007" doi: "http://dx.doi.org/10.1007/978-3-540-73449-9_30" links: doi: "http://dx.doi.org/10.1007/978-3-540-73449-9_30" tags: - "termination" researchr: "https://researchr.org/publication/ZantemaW07" cites: 0 citedby: 0 pages: "404-418" booktitle: "RTA" kind: "inproceedings" key: "ZantemaW07" - title: "Termination of Context-Sensitive Rewriting" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1997" tags: - "termination" - "graph-rewriting" - "context-aware" - "rewriting" researchr: "https://researchr.org/publication/Zantema97" cites: 0 citedby: 0 pages: "172-186" booktitle: "RTA" kind: "inproceedings" key: "Zantema97" - title: "Termination Modulo Equations by Abstract Commutation with an Application to Iteration" author: - name: "Wan Fokkink" link: "http://www.cs.vu.nl/~wanf/" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1997" doi: "http://dx.doi.org/10.1016/S0304-3975(96)00254-X" links: doi: "http://dx.doi.org/10.1016/S0304-3975(96)00254-X" tags: - "termination" researchr: "https://researchr.org/publication/FokkinkZ97" cites: 0 citedby: 0 journal: "TCS" volume: "177" number: "2" pages: "407-423" kind: "article" key: "FokkinkZ97" - title: "Finding Finite Automata That Certify Termination of String Rewriting" author: - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" - name: "Dieter Hofbauer" link: "https://researchr.org/alias/dieter-hofbauer" - name: "Johannes Waldmann" link: "https://researchr.org/alias/johannes-waldmann" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2004" doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3317&spage=134" links: doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3317&spage=134" tags: - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/GeserHWZ04" cites: 0 citedby: 0 pages: "134-145" booktitle: "wia" kind: "inproceedings" key: "GeserHWZ04" - title: "Certification of Proving Termination of Term Rewriting by Matrix Interpretations" author: - name: "Adam Koprowski" link: "https://researchr.org/alias/adam-koprowski" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2008" doi: "http://dx.doi.org/10.1007/978-3-540-77566-9_28" links: doi: "http://dx.doi.org/10.1007/978-3-540-77566-9_28" tags: - "term rewriting" - "termination" - "graph-rewriting" - "certification" - "rewriting" researchr: "https://researchr.org/publication/KoprowskiZ08" cites: 0 citedby: 0 pages: "328-339" booktitle: "sofsem" kind: "inproceedings" key: "KoprowskiZ08" - title: "Basic Process Algebra with Iteration: Completeness of its Equational Axioms" author: - name: "Wan Fokkink" link: "http://www.cs.vu.nl/~wanf/" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1994" tags: - "completeness" - "process algebra" - " algebra" researchr: "https://researchr.org/publication/FokkinkZ94" cites: 0 citedby: 0 journal: "cj" volume: "37" number: "4" pages: "259-268" kind: "article" key: "FokkinkZ94" - title: "The Termination Competition" author: - name: "Claude Marché" link: "https://researchr.org/alias/claude-march%C3%A9" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2007" doi: "http://dx.doi.org/10.1007/978-3-540-73449-9_23" links: doi: "http://dx.doi.org/10.1007/978-3-540-73449-9_23" tags: - "termination" researchr: "https://researchr.org/publication/MarcheZ07" cites: 0 citedby: 0 pages: "303-313" booktitle: "RTA" kind: "inproceedings" key: "MarcheZ07" - title: "A Complete Characterization of Termination of O:::p::: 1:::q::: -> 1:::r::: O:::s:::" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" year: "1995" tags: - "completeness" - "termination" researchr: "https://researchr.org/publication/ZantemaG95" cites: 0 citedby: 0 pages: "41-55" booktitle: "RTA" kind: "inproceedings" key: "ZantemaG95" - title: "Liveness in Rewriting" author: - name: "Jürgen Giesl" link: "http://verify.rwth-aachen.de/giesl/" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2003" doi: "http://link.springer.de/link/service/series/0558/bibs/2706/27060321.htm" links: doi: "http://link.springer.de/link/service/series/0558/bibs/2706/27060321.htm" tags: - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/GieslZ03%3A0" cites: 0 citedby: 0 pages: "321-336" booktitle: "RTA" kind: "inproceedings" key: "GieslZ03:0" - title: "Termination of Term Rewriting by Interpretation" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1992" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/Zantema92a" cites: 0 citedby: 0 pages: "155-167" booktitle: "ctrs" kind: "inproceedings" key: "Zantema92a" - title: "On tree automata that certify termination of left-linear term rewriting systems" author: - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" - name: "Dieter Hofbauer" link: "https://researchr.org/alias/dieter-hofbauer" - name: "Johannes Waldmann" link: "https://researchr.org/alias/johannes-waldmann" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2007" doi: "http://dx.doi.org/10.1016/j.ic.2006.08.007" links: doi: "http://dx.doi.org/10.1016/j.ic.2006.08.007" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/GeserHWZ07" cites: 0 citedby: 0 journal: "iandc" volume: "205" number: "4" pages: "512-534" kind: "article" key: "GeserHWZ07" - title: "Termination of Term Rewriting: Interpretation and Type Elimination" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1994" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/Zantema94" cites: 0 citedby: 0 journal: "JSC" volume: "17" number: "1" pages: "23-50" kind: "article" key: "Zantema94" - title: "Matrix Interpretations for Proving Termination of Term Rewriting" author: - name: "Jörg Endrullis" link: "https://researchr.org/alias/j%C3%B6rg-endrullis" - name: "Johannes Waldmann" link: "https://researchr.org/alias/johannes-waldmann" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2006" doi: "http://dx.doi.org/10.1007/11814771_47" links: doi: "http://dx.doi.org/10.1007/11814771_47" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/EndrullisWZ06" cites: 0 citedby: 0 pages: "574-588" booktitle: "cade" kind: "inproceedings" key: "EndrullisWZ06" - title: "Termination of String Rewriting Proved Automatically" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2005" doi: "http://dx.doi.org/10.1007/s10817-005-6545-0" links: doi: "http://dx.doi.org/10.1007/s10817-005-6545-0" tags: - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/Zantema05%3A0" cites: 0 citedby: 0 journal: "JAR" volume: "34" number: "2" pages: "105-139" kind: "article" key: "Zantema05:0" - title: "Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems" author: - name: "Adam Koprowski" link: "https://researchr.org/alias/adam-koprowski" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2006" doi: "http://dx.doi.org/10.1007/11814771_30" links: doi: "http://dx.doi.org/10.1007/11814771_30" tags: - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/KoprowskiZ06" cites: 0 citedby: 0 pages: "332-346" booktitle: "cade" kind: "inproceedings" key: "KoprowskiZ06" - title: "Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" - name: "Stefan Wagemans" link: "https://researchr.org/alias/stefan-wagemans" - name: "Dragan Bosnacki" link: "https://researchr.org/alias/dragan-bosnacki" year: "2008" doi: "http://dx.doi.org/10.1007/978-3-540-70600-7_23" links: doi: "http://dx.doi.org/10.1007/978-3-540-70600-7_23" researchr: "https://researchr.org/publication/ZantemaWB08" cites: 0 citedby: 0 pages: "303-317" booktitle: "bird" kind: "inproceedings" key: "ZantemaWB08" - title: "A rewriting approach to binary decision diagrams" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" - name: "Jaco van de Pol" link: "https://researchr.org/alias/jaco-van-de-pol" year: "2001" tags: - "graph-rewriting" - "rewriting" - "systematic-approach" researchr: "https://researchr.org/publication/ZantemaP01" cites: 0 citedby: 0 journal: "jlp" volume: "49" number: "1-2" pages: "61-86" kind: "article" key: "ZantemaP01" - title: "Degrees of Undecidability in Term Rewriting" author: - name: "Jörg Endrullis" link: "https://researchr.org/alias/j%C3%A3%C2%B6rg-endrullis" - name: "Herman Geuvers" link: "https://researchr.org/alias/herman-geuvers" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2009" doi: "http://dx.doi.org/10.1007/978-3-642-04027-6_20" links: doi: "http://dx.doi.org/10.1007/978-3-642-04027-6_20" tags: - "term rewriting" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/EndrullisGZ09" cites: 0 citedby: 0 pages: "255-270" booktitle: "csl" kind: "inproceedings" key: "EndrullisGZ09" - title: "Proving Liveness with Fairness Using Rewriting" author: - name: "Adam Koprowski" link: "https://researchr.org/alias/adam-koprowski" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2005" doi: "http://dx.doi.org/10.1007/11559306_13" links: doi: "http://dx.doi.org/10.1007/11559306_13" tags: - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/KoprowskiZ05" cites: 0 citedby: 0 pages: "232-247" booktitle: "frocos" kind: "inproceedings" key: "KoprowskiZ05" - title: "Total Termination of Term Rewriting is Undecidable" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1995" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/Zantema95%3A0" cites: 0 citedby: 0 journal: "JSC" volume: "20" number: "1" pages: "43-60" kind: "article" key: "Zantema95:0" - title: "Total Termination of Term Rewriting" author: - name: "Maria C. F. Ferreira" link: "https://researchr.org/alias/maria-c.-f.-ferreira" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1993" tags: - "term rewriting" - "termination" - "graph-rewriting" - "C++" - "rewriting" researchr: "https://researchr.org/publication/FerreiraZ93" cites: 0 citedby: 0 pages: "213-227" booktitle: "RTA" kind: "inproceedings" key: "FerreiraZ93" - title: "Total Termination of Term Rewriting" author: - name: "Maria C. F. Ferreira" link: "https://researchr.org/alias/maria-c.-f.-ferreira" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1996" doi: "http://link.springer.de/link/service/journals/00200/bibs/6007002/60070133.htm" links: doi: "http://link.springer.de/link/service/journals/00200/bibs/6007002/60070133.htm" tags: - "term rewriting" - "termination" - "graph-rewriting" - "C++" - "rewriting" researchr: "https://researchr.org/publication/FerreiraZ96" cites: 0 citedby: 0 journal: "aaecc" volume: "7" number: "2" pages: "133-162" kind: "article" key: "FerreiraZ96" - title: "Simulating liveness by reduction strategies" author: - name: "Jürgen Giesl" link: "http://verify.rwth-aachen.de/giesl/" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2003" doi: "http://www1.elsevier.com/gej-ng/31/29/23/135/49/show/Products/notes/index.htt#005" links: doi: "http://www1.elsevier.com/gej-ng/31/29/23/135/49/show/Products/notes/index.htt#005" researchr: "https://researchr.org/publication/GieslZ03" cites: 0 citedby: 0 journal: "ENTCS" volume: "86" number: "4" pages: "641-656" kind: "article" key: "GieslZ03" - title: "Finding finite automata that certify termination of string rewriting systems" author: - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" - name: "Dieter Hofbauer" link: "https://researchr.org/alias/dieter-hofbauer" - name: "Johannes Waldmann" link: "https://researchr.org/alias/johannes-waldmann" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2005" doi: "http://dx.doi.org/10.1142/S0129054105003108" links: doi: "http://dx.doi.org/10.1142/S0129054105003108" tags: - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/GeserHWZ05%3A0" cites: 0 citedby: 0 journal: "ijfcs" volume: "16" number: "3" pages: "471-486" kind: "article" key: "GeserHWZ05:0" - title: "Well-foundedness of Term Orderings" author: - name: "Maria C. F. Ferreira" link: "https://researchr.org/alias/maria-c.-f.-ferreira" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1994" tags: - "C++" researchr: "https://researchr.org/publication/FerreiraZ94%3A0" cites: 0 citedby: 0 pages: "106-123" booktitle: "ctrs" kind: "inproceedings" key: "FerreiraZ94:0" - title: "On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems" author: - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" - name: "Dieter Hofbauer" link: "https://researchr.org/alias/dieter-hofbauer" - name: "Johannes Waldmann" link: "https://researchr.org/alias/johannes-waldmann" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2005" doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=353" links: doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=353" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/GeserHWZ05" cites: 0 citedby: 0 pages: "353-367" booktitle: "RTA" kind: "inproceedings" key: "GeserHWZ05" - title: "Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy" author: - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" - name: "Aart Middeldorp" link: "http://cl-informatik.uibk.ac.at/~ami/" - name: "Enno Ohlebusch" link: "https://researchr.org/alias/enno-ohlebusch" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2002" doi: "http://dx.doi.org/10.1006/inco.2002.3150" links: doi: "http://dx.doi.org/10.1006/inco.2002.3150" tags: - "term rewriting" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/GeserMOZ02a" cites: 0 citedby: 0 journal: "iandc" volume: "178" number: "1" pages: "132-148" kind: "article" key: "GeserMOZ02a" - title: "Adding constants to string rewriting" author: - name: "René Thiemann" link: "https://researchr.org/alias/ren%C3%A9-thiemann" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" - name: "Jürgen Giesl" link: "http://verify.rwth-aachen.de/giesl/" - name: "Peter Schneider-Kamp" link: "https://researchr.org/alias/peter-schneider-kamp" year: "2008" doi: "http://dx.doi.org/10.1007/s00200-008-0060-6" links: doi: "http://dx.doi.org/10.1007/s00200-008-0060-6" tags: - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/ThiemannZGS08" cites: 0 citedby: 0 journal: "aaecc" volume: "19" number: "1" pages: "27-38" kind: "article" key: "ThiemannZGS08" - title: "Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially" author: - name: "Jan Friso Groote" link: "http://www.win.tue.nl/~jfg/" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2001" doi: "http://link.springer.de/link/service/series/0558/bibs/2244/22440033.htm" links: doi: "http://link.springer.de/link/service/series/0558/bibs/2244/22440033.htm" researchr: "https://researchr.org/publication/GrooteZ01" cites: 0 citedby: 0 pages: "33-38" booktitle: "ershov" kind: "inproceedings" key: "GrooteZ01" - title: "Matrix Interpretations for Proving Termination of Term Rewriting" author: - name: "Jörg Endrullis" link: "https://researchr.org/alias/j%C3%B6rg-endrullis" - name: "Johannes Waldmann" link: "https://researchr.org/alias/johannes-waldmann" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2008" doi: "http://dx.doi.org/10.1007/s10817-007-9087-9" links: doi: "http://dx.doi.org/10.1007/s10817-007-9087-9" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/EndrullisWZ08" cites: 0 citedby: 0 journal: "JAR" volume: "40" number: "2-3" pages: "195-220" kind: "article" key: "EndrullisWZ08" - title: "Relative Undecidability in Term Rewriting" author: - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" - name: "Aart Middeldorp" link: "http://cl-informatik.uibk.ac.at/~ami/" - name: "Enno Ohlebusch" link: "https://researchr.org/alias/enno-ohlebusch" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1996" tags: - "term rewriting" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/GeserMOZ96" cites: 0 citedby: 0 pages: "150-166" booktitle: "csl" kind: "inproceedings" key: "GeserMOZ96" - title: "A Proof System and a Decision Procedure for Equality Logic" author: - name: "Olga Tveretina" link: "https://researchr.org/alias/olga-tveretina" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2004" doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2976&spage=530" links: doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2976&spage=530" tags: - "logic" researchr: "https://researchr.org/publication/TveretinaZ04" cites: 0 citedby: 0 pages: "530-539" booktitle: "latin" kind: "inproceedings" key: "TveretinaZ04" - title: "Transforming Termination by Self-Labelling" author: - name: "Aart Middeldorp" link: "http://cl-informatik.uibk.ac.at/~ami/" - name: "Hitoshi Ohsaki" link: "https://researchr.org/alias/hitoshi-ohsaki" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1996" tags: - "termination" researchr: "https://researchr.org/publication/MiddeldorpOZ96" cites: 0 citedby: 0 pages: "373-387" booktitle: "cade" kind: "inproceedings" key: "MiddeldorpOZ96" - title: "Rewrite Systems for Integer Arithmetic" author: - name: "H. R. Walters" link: "https://researchr.org/alias/h.-r.-walters" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1995" tags: - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/WaltersZ95" cites: 0 citedby: 0 pages: "324-338" booktitle: "RTA" kind: "inproceedings" key: "WaltersZ95" - title: "Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules" author: - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" - name: "Aart Middeldorp" link: "http://cl-informatik.uibk.ac.at/~ami/" - name: "Enno Ohlebusch" link: "https://researchr.org/alias/enno-ohlebusch" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1997" tags: - "rule-based" - "termination" - "graph-rewriting" - "rules" - "rewriting" researchr: "https://researchr.org/publication/GeserMOZ97" cites: 0 citedby: 0 pages: "237-248" booktitle: "tapsoft" kind: "inproceedings" key: "GeserMOZ97" - title: "The Termination Hierarchy for Term Rewriting" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2001" doi: "http://link.springer.de/link/service/journals/00200/bibs/1012001/10120003.htm" links: doi: "http://link.springer.de/link/service/journals/00200/bibs/1012001/10120003.htm" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/Zantema01" cites: 0 citedby: 0 journal: "aaecc" volume: "12" number: "1/2" pages: "3-19" kind: "article" key: "Zantema01" - title: "Dummy Elimination: Making Termination Easier" author: - name: "Maria C. F. Ferreira" link: "https://researchr.org/alias/maria-c.-f.-ferreira" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1995" tags: - "termination" - "C++" researchr: "https://researchr.org/publication/FerreiraZ95" cites: 0 citedby: 0 pages: "243-252" booktitle: "fct" kind: "inproceedings" key: "FerreiraZ95" - title: "A Complete Characterization of Termination of 0:::p::: 1:::q:::-> 1:::r::: 0:::s:::" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" year: "2000" doi: "http://link.springer.de/link/service/journals/00200/bibs/0011001/00110001.htm" links: doi: "http://link.springer.de/link/service/journals/00200/bibs/0011001/00110001.htm" tags: - "completeness" - "termination" researchr: "https://researchr.org/publication/ZantemaG00" cites: 0 citedby: 0 journal: "aaecc" volume: "11" number: "1" pages: "1-25" kind: "article" key: "ZantemaG00" - title: "Simple Termination of Rewrite Systems" author: - name: "Aart Middeldorp" link: "http://cl-informatik.uibk.ac.at/~ami/" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1997" doi: "http://dx.doi.org/10.1016/S0304-3975(96)00172-7" links: doi: "http://dx.doi.org/10.1016/S0304-3975(96)00172-7" tags: - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/MiddeldorpZ97" cites: 0 citedby: 0 journal: "TCS" volume: "175" number: "1" pages: "127-158" kind: "article" key: "MiddeldorpZ97" - title: "Termination of Term Rewriting by Semantic Labelling" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1995" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/Zantema95" cites: 0 citedby: 0 journal: "FUIN" volume: "24" number: "1/2" pages: "89-105" kind: "article" key: "Zantema95" - title: "A Transformational Approach to Prove Outermost Termination Automatically" author: - name: "Matthias Raffelsieper" link: "https://researchr.org/alias/matthias-raffelsieper" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2009" doi: "http://dx.doi.org/10.1016/j.entcs.2009.03.032" links: doi: "http://dx.doi.org/10.1016/j.entcs.2009.03.032" tags: - "termination" - "systematic-approach" - "transformation" researchr: "https://researchr.org/publication/RaffelsieperZ09" cites: 0 citedby: 0 journal: "ENTCS" volume: "237" pages: "3-21" kind: "article" key: "RaffelsieperZ09" - title: "Longest Segment Problems" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1992" researchr: "https://researchr.org/publication/Zantema92%3A0" cites: 0 citedby: 0 journal: "SCP" volume: "18" number: "1" pages: "39-66" kind: "article" key: "Zantema92:0" - title: "Binary Decision Diagrams by Shard Rewriting" author: - name: "Jaco van de Pol" link: "https://researchr.org/alias/jaco-van-de-pol" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2000" doi: "http://link.springer.de/link/service/series/0558/bibs/1893/18930609.htm" links: doi: "http://link.springer.de/link/service/series/0558/bibs/1893/18930609.htm" tags: - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/PolZ00" cites: 0 citedby: 0 pages: "609-618" booktitle: "mfcs" kind: "inproceedings" key: "PolZ00" - title: "Generalized Innermost Rewriting" author: - name: "Jaco van de Pol" link: "https://researchr.org/alias/jaco-van-de-pol" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2005" doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=2" links: doi: "http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=2" tags: - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/PolZ05" cites: 0 citedby: 0 pages: "2-16" booktitle: "RTA" kind: "inproceedings" key: "PolZ05" - title: "Syntactical Analysis of Total Termination" author: - name: "Maria C. F. Ferreira" link: "https://researchr.org/alias/maria-c.-f.-ferreira" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1994" tags: - "analysis" - "termination" - "C++" researchr: "https://researchr.org/publication/FerreiraZ94" cites: 0 citedby: 0 pages: "204-222" booktitle: "icalp" kind: "inproceedings" key: "FerreiraZ94" - title: "Reducing Right-Hand Sides for Termination" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2005" doi: "http://dx.doi.org/10.1007/11601548_12" links: doi: "http://dx.doi.org/10.1007/11601548_12" tags: - "termination" researchr: "https://researchr.org/publication/Zantema05" cites: 0 citedby: 0 pages: "173-197" booktitle: "BIRTHDAY" kind: "inproceedings" key: "Zantema05" - title: "Type Removal in Term Rewriting" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1992" tags: - "term rewriting" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/Zantema92" cites: 0 citedby: 0 pages: "148-154" booktitle: "ctrs" kind: "inproceedings" key: "Zantema92" - title: "Generalizing DPLL and satisfiability for equalities" author: - name: "Bahareh Badban" link: "https://researchr.org/alias/bahareh-badban" - name: "Jaco van de Pol" link: "https://researchr.org/alias/jaco-van-de-pol" - name: "Olga Tveretina" link: "https://researchr.org/alias/olga-tveretina" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2007" doi: "http://dx.doi.org/10.1016/j.ic.2007.03.003" links: doi: "http://dx.doi.org/10.1016/j.ic.2007.03.003" researchr: "https://researchr.org/publication/BadbanPTZ07" cites: 0 citedby: 0 journal: "iandc" volume: "205" number: "8" pages: "1188-1211" kind: "article" key: "BadbanPTZ07" - title: "Resolution and binary decision diagrams cannot simulate each other polynomially" author: - name: "Jan Friso Groote" link: "http://www.win.tue.nl/~jfg/" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2003" doi: "http://dx.doi.org/10.1016/S0166-218X(02)00403-1" links: doi: "http://dx.doi.org/10.1016/S0166-218X(02)00403-1" researchr: "https://researchr.org/publication/GrooteZ03" cites: 0 citedby: 0 journal: "DAM" volume: "130" number: "2" pages: "157-171" kind: "article" key: "GrooteZ03" - title: "Termination of Logic Programs Using Semantic Unification" author: - name: "Thomas Arts" link: "https://researchr.org/alias/thomas-arts" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1995" tags: - "termination" - "logic programming" - "logic" researchr: "https://researchr.org/publication/ArtsZ95" cites: 0 citedby: 0 pages: "219-233" booktitle: "LOPSTR" kind: "inproceedings" key: "ArtsZ95" - title: "Simple Termination Revisited" author: - name: "Aart Middeldorp" link: "http://cl-informatik.uibk.ac.at/~ami/" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1994" tags: - "termination" researchr: "https://researchr.org/publication/MiddeldorpZ94" cites: 0 citedby: 0 pages: "451-465" booktitle: "cade" kind: "inproceedings" key: "MiddeldorpZ94" - title: "Well-Definedness of Streams by Termination" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2009" doi: "http://dx.doi.org/10.1007/978-3-642-02348-4_12" links: doi: "http://dx.doi.org/10.1007/978-3-642-02348-4_12" tags: - "termination" researchr: "https://researchr.org/publication/Zantema09" cites: 0 citedby: 0 pages: "164-178" booktitle: "RTA" kind: "inproceedings" key: "Zantema09" - title: "Non-looping string rewriting" author: - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "1999" tags: - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/GeserZ99" cites: 0 citedby: 0 journal: "ita" volume: "33" number: "3" pages: "279-302" kind: "article" key: "GeserZ99" - title: "Sizes of Ordered Decision Trees" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" - name: "Hans Leo Bodlaender" link: "http://people.cs.uu.nl/hansb/" year: "2002" doi: "http://dx.doi.org/10.1142/S0129054102001205" links: doi: "http://dx.doi.org/10.1142/S0129054102001205" researchr: "https://researchr.org/publication/ZantemaB02" cites: 0 citedby: 0 journal: "ijfcs" volume: "13" number: "3" pages: "445-458" kind: "article" key: "ZantemaB02" - title: "Relative Undecidability in Term Rewriting: I. The Termination Hierarchy" author: - name: "Alfons Geser" link: "https://researchr.org/alias/alfons-geser" - name: "Aart Middeldorp" link: "http://cl-informatik.uibk.ac.at/~ami/" - name: "Enno Ohlebusch" link: "https://researchr.org/alias/enno-ohlebusch" - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" year: "2002" doi: "http://dx.doi.org/10.1006/inco.2002.3120" links: doi: "http://dx.doi.org/10.1006/inco.2002.3120" tags: - "term rewriting" - "termination" - "graph-rewriting" - "rewriting" researchr: "https://researchr.org/publication/GeserMOZ02" cites: 0 citedby: 0 journal: "iandc" volume: "178" number: "1" pages: "101-131" kind: "article" key: "GeserMOZ02" - title: "Transforming equality logic to propositional logic" author: - name: "Hans Zantema" link: "http://www.win.tue.nl/~hzantema/" - name: "Jan Friso Groote" link: "http://www.win.tue.nl/~jfg/" year: "2003" doi: "http://www.elsevier.com/gej-ng/31/29/23/135/23/show/Products/notes/index.htt#015" links: doi: "http://www.elsevier.com/gej-ng/31/29/23/135/23/show/Products/notes/index.htt#015" tags: - "logic" researchr: "https://researchr.org/publication/ZantemaG03" cites: 0 citedby: 0 journal: "ENTCS" volume: "86" number: "1" pages: "162-173" kind: "article" key: "ZantemaG03"