@article{Zantema91,
  title = {Minimizing Sums of Addition Chains},
  author = {Hans Zantema},
  year = {1991},
  researchr = {https://researchr.org/publication/Zantema91},
  cites = {0},
  citedby = {0},
  journal = {jal},
  volume = {12},
  number = {2},
  pages = {281-307},
}

@inproceedings{Zantema08,
  title = {Normalization of Infinite Terms},
  author = {Hans Zantema},
  year = {2008},
  doi = {10.1007/978-3-540-70590-1_30},
  url = {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},
}

@inproceedings{RaffelsieperMRSZ09,
  title = {Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models},
  author = {Matthias Raffelsieper and Mohammad Reza Mousavi and Jan-Willem Roorda and Chris W. H. Strolenberg and Hans Zantema},
  year = {2009},
  doi = {10.1007/978-3-642-04570-7_11},
  url = {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},
}

@inproceedings{Zantema04,
  title = {TORPA: Termination of Rewriting Proved Automatically},
  author = {Hans Zantema},
  year = {2004},
  url = {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},
}

@article{ZantemaB00,
  title = {Finding Small Equivalent Decision Trees is Hard},
  author = {Hans Zantema and Hans Leo Bodlaender},
  year = {2000},
  researchr = {https://researchr.org/publication/ZantemaB00},
  cites = {0},
  citedby = {0},
  journal = {ijfcs},
  volume = {11},
  number = {2},
  pages = {343-354},
}

@inproceedings{ZantemaW07,
  title = {Termination by Quasi-periodic Interpretations},
  author = {Hans Zantema and Johannes Waldmann},
  year = {2007},
  doi = {10.1007/978-3-540-73449-9_30},
  url = {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},
}

@inproceedings{Zantema97,
  title = {Termination of Context-Sensitive Rewriting},
  author = {Hans Zantema},
  year = {1997},
  tags = {termination, graph-rewriting, context-aware, rewriting},
  researchr = {https://researchr.org/publication/Zantema97},
  cites = {0},
  citedby = {0},
  pages = {172-186},
  booktitle = {RTA},
}

@article{FokkinkZ97,
  title = {Termination Modulo Equations by Abstract Commutation with an Application to Iteration},
  author = {Wan Fokkink and Hans Zantema},
  year = {1997},
  doi = {10.1016/S0304-3975(96)00254-X},
  url = {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},
}

@inproceedings{GeserHWZ04,
  title = {Finding Finite Automata That Certify Termination of String Rewriting},
  author = {Alfons Geser and Dieter Hofbauer and Johannes Waldmann and Hans Zantema},
  year = {2004},
  url = {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},
}

@inproceedings{KoprowskiZ08,
  title = {Certification of Proving Termination of Term Rewriting by Matrix Interpretations},
  author = {Adam Koprowski and Hans Zantema},
  year = {2008},
  doi = {10.1007/978-3-540-77566-9_28},
  url = {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},
}

@article{FokkinkZ94,
  title = {Basic Process Algebra with Iteration: Completeness of its Equational Axioms},
  author = {Wan Fokkink and Hans Zantema},
  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},
}

@inproceedings{MarcheZ07,
  title = {The Termination Competition},
  author = {Claude Marché and Hans Zantema},
  year = {2007},
  doi = {10.1007/978-3-540-73449-9_23},
  url = {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},
}

@inproceedings{ZantemaG95,
  title = {A Complete Characterization of Termination of O:::p::: 1:::q::: -> 1:::r::: O:::s:::},
  author = {Hans Zantema and Alfons Geser},
  year = {1995},
  tags = {completeness, termination},
  researchr = {https://researchr.org/publication/ZantemaG95},
  cites = {0},
  citedby = {0},
  pages = {41-55},
  booktitle = {RTA},
}

@inproceedings{GieslZ03:0,
  title = {Liveness in Rewriting},
  author = {Jürgen Giesl and Hans Zantema},
  year = {2003},
  url = {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},
}

@inproceedings{Zantema92a,
  title = {Termination of Term Rewriting by Interpretation},
  author = {Hans Zantema},
  year = {1992},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Zantema92a},
  cites = {0},
  citedby = {0},
  pages = {155-167},
  booktitle = {ctrs},
}

@article{GeserHWZ07,
  title = {On tree automata that certify termination of left-linear term rewriting systems},
  author = {Alfons Geser and Dieter Hofbauer and Johannes Waldmann and Hans Zantema},
  year = {2007},
  doi = {10.1016/j.ic.2006.08.007},
  url = {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},
}

@article{Zantema94,
  title = {Termination of Term Rewriting: Interpretation and Type Elimination},
  author = {Hans Zantema},
  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},
}

@inproceedings{EndrullisWZ06,
  title = {Matrix Interpretations for Proving Termination of Term Rewriting},
  author = {Jörg Endrullis and Johannes Waldmann and Hans Zantema},
  year = {2006},
  doi = {10.1007/11814771_47},
  url = {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},
}

@article{Zantema05:0,
  title = {Termination of String Rewriting Proved Automatically},
  author = {Hans Zantema},
  year = {2005},
  doi = {10.1007/s10817-005-6545-0},
  url = {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},
}

@inproceedings{KoprowskiZ06,
  title = {Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems},
  author = {Adam Koprowski and Hans Zantema},
  year = {2006},
  doi = {10.1007/11814771_30},
  url = {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},
}

@inproceedings{ZantemaWB08,
  title = {Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets},
  author = {Hans Zantema and Stefan Wagemans and Dragan Bosnacki},
  year = {2008},
  doi = {10.1007/978-3-540-70600-7_23},
  url = {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},
}

@article{ZantemaP01,
  title = {A rewriting approach to binary decision diagrams},
  author = {Hans Zantema and 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},
}

@inproceedings{EndrullisGZ09,
  title = {Degrees of Undecidability in Term Rewriting},
  author = {Jörg Endrullis and Herman Geuvers and Hans Zantema},
  year = {2009},
  doi = {10.1007/978-3-642-04027-6_20},
  url = {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},
}

@inproceedings{KoprowskiZ05,
  title = {Proving Liveness with Fairness Using Rewriting},
  author = {Adam Koprowski and Hans Zantema},
  year = {2005},
  doi = {10.1007/11559306_13},
  url = {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},
}

@article{Zantema95:0,
  title = {Total Termination of Term Rewriting is Undecidable},
  author = {Hans Zantema},
  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},
}

@inproceedings{FerreiraZ93,
  title = {Total Termination of Term Rewriting},
  author = {Maria C. F. Ferreira and Hans Zantema},
  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},
}

@article{FerreiraZ96,
  title = {Total Termination of Term Rewriting},
  author = {Maria C. F. Ferreira and Hans Zantema},
  year = {1996},
  url = {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},
}

@article{GieslZ03,
  title = {Simulating liveness by reduction strategies},
  author = {Jürgen Giesl and Hans Zantema},
  year = {2003},
  url = {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},
}

@article{GeserHWZ05:0,
  title = {Finding finite automata that certify termination of string rewriting systems},
  author = {Alfons Geser and Dieter Hofbauer and Johannes Waldmann and Hans Zantema},
  year = {2005},
  doi = {10.1142/S0129054105003108},
  url = {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},
}

@inproceedings{FerreiraZ94:0,
  title = {Well-foundedness of Term Orderings},
  author = {Maria C. F. Ferreira and Hans Zantema},
  year = {1994},
  tags = {C++},
  researchr = {https://researchr.org/publication/FerreiraZ94%3A0},
  cites = {0},
  citedby = {0},
  pages = {106-123},
  booktitle = {ctrs},
}

@inproceedings{GeserHWZ05,
  title = {On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems},
  author = {Alfons Geser and Dieter Hofbauer and Johannes Waldmann and Hans Zantema},
  year = {2005},
  url = {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},
}

@article{GeserMOZ02a,
  title = {Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy},
  author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema},
  year = {2002},
  doi = {10.1006/inco.2002.3150},
  url = {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},
}

@article{ThiemannZGS08,
  title = {Adding constants to string rewriting},
  author = {René Thiemann and Hans Zantema and Jürgen Giesl and Peter Schneider-Kamp},
  year = {2008},
  doi = {10.1007/s00200-008-0060-6},
  url = {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},
}

@inproceedings{GrooteZ01,
  title = {Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially},
  author = {Jan Friso Groote and Hans Zantema},
  year = {2001},
  url = {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},
}

@article{EndrullisWZ08,
  title = {Matrix Interpretations for Proving Termination of Term Rewriting},
  author = {Jörg Endrullis and Johannes Waldmann and Hans Zantema},
  year = {2008},
  doi = {10.1007/s10817-007-9087-9},
  url = {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},
}

@inproceedings{GeserMOZ96,
  title = {Relative Undecidability in Term Rewriting},
  author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema},
  year = {1996},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GeserMOZ96},
  cites = {0},
  citedby = {0},
  pages = {150-166},
  booktitle = {csl},
}

@inproceedings{TveretinaZ04,
  title = {A Proof System and a Decision Procedure for Equality Logic},
  author = {Olga Tveretina and Hans Zantema},
  year = {2004},
  url = {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},
}

@inproceedings{MiddeldorpOZ96,
  title = {Transforming Termination by Self-Labelling},
  author = {Aart Middeldorp and Hitoshi Ohsaki and Hans Zantema},
  year = {1996},
  tags = {termination},
  researchr = {https://researchr.org/publication/MiddeldorpOZ96},
  cites = {0},
  citedby = {0},
  pages = {373-387},
  booktitle = {cade},
}

@inproceedings{WaltersZ95,
  title = {Rewrite Systems for Integer Arithmetic},
  author = {H. R. Walters and Hans Zantema},
  year = {1995},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/WaltersZ95},
  cites = {0},
  citedby = {0},
  pages = {324-338},
  booktitle = {RTA},
}

@inproceedings{GeserMOZ97,
  title = {Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules},
  author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema},
  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},
}

@article{Zantema01,
  title = {The Termination Hierarchy for Term Rewriting},
  author = {Hans Zantema},
  year = {2001},
  url = {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},
}

@inproceedings{FerreiraZ95,
  title = {Dummy Elimination: Making Termination Easier},
  author = {Maria C. F. Ferreira and Hans Zantema},
  year = {1995},
  tags = {termination, C++},
  researchr = {https://researchr.org/publication/FerreiraZ95},
  cites = {0},
  citedby = {0},
  pages = {243-252},
  booktitle = {fct},
}

@article{ZantemaG00,
  title = {A Complete Characterization of Termination of 0:::p::: 1:::q:::-> 1:::r::: 0:::s:::},
  author = {Hans Zantema and Alfons Geser},
  year = {2000},
  url = {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},
}

@article{MiddeldorpZ97,
  title = {Simple Termination of Rewrite Systems},
  author = {Aart Middeldorp and Hans Zantema},
  year = {1997},
  doi = {10.1016/S0304-3975(96)00172-7},
  url = {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},
}

@article{Zantema95,
  title = {Termination of Term Rewriting by Semantic Labelling},
  author = {Hans Zantema},
  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},
}

@article{RaffelsieperZ09,
  title = {A Transformational Approach to Prove Outermost Termination Automatically},
  author = {Matthias Raffelsieper and Hans Zantema},
  year = {2009},
  doi = {10.1016/j.entcs.2009.03.032},
  url = {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},
}

@article{Zantema92:0,
  title = {Longest Segment Problems},
  author = {Hans Zantema},
  year = {1992},
  researchr = {https://researchr.org/publication/Zantema92%3A0},
  cites = {0},
  citedby = {0},
  journal = {SCP},
  volume = {18},
  number = {1},
  pages = {39-66},
}

@inproceedings{PolZ00,
  title = {Binary Decision Diagrams by Shard Rewriting},
  author = {Jaco van de Pol and Hans Zantema},
  year = {2000},
  url = {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},
}

@inproceedings{PolZ05,
  title = {Generalized Innermost Rewriting},
  author = {Jaco van de Pol and Hans Zantema},
  year = {2005},
  url = {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},
}

@inproceedings{FerreiraZ94,
  title = {Syntactical Analysis of Total Termination},
  author = {Maria C. F. Ferreira and Hans Zantema},
  year = {1994},
  tags = {analysis, termination, C++},
  researchr = {https://researchr.org/publication/FerreiraZ94},
  cites = {0},
  citedby = {0},
  pages = {204-222},
  booktitle = {icalp},
}

@inproceedings{Zantema05,
  title = {Reducing Right-Hand Sides for Termination},
  author = {Hans Zantema},
  year = {2005},
  doi = {10.1007/11601548_12},
  url = {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},
}

@inproceedings{Zantema92,
  title = {Type Removal in Term Rewriting},
  author = {Hans Zantema},
  year = {1992},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Zantema92},
  cites = {0},
  citedby = {0},
  pages = {148-154},
  booktitle = {ctrs},
}

@article{BadbanPTZ07,
  title = {Generalizing DPLL and satisfiability for equalities},
  author = {Bahareh Badban and Jaco van de Pol and Olga Tveretina and Hans Zantema},
  year = {2007},
  doi = {10.1016/j.ic.2007.03.003},
  url = {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},
}

@article{GrooteZ03,
  title = {Resolution and binary decision diagrams cannot simulate each other polynomially},
  author = {Jan Friso Groote and Hans Zantema},
  year = {2003},
  doi = {10.1016/S0166-218X(02)00403-1},
  url = {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},
}

@inproceedings{ArtsZ95,
  title = {Termination of Logic Programs Using Semantic Unification},
  author = {Thomas Arts and Hans Zantema},
  year = {1995},
  tags = {termination, logic programming, logic},
  researchr = {https://researchr.org/publication/ArtsZ95},
  cites = {0},
  citedby = {0},
  pages = {219-233},
  booktitle = {LOPSTR},
}

@inproceedings{MiddeldorpZ94,
  title = {Simple Termination Revisited},
  author = {Aart Middeldorp and Hans Zantema},
  year = {1994},
  tags = {termination},
  researchr = {https://researchr.org/publication/MiddeldorpZ94},
  cites = {0},
  citedby = {0},
  pages = {451-465},
  booktitle = {cade},
}

@inproceedings{Zantema09,
  title = {Well-Definedness of Streams by Termination},
  author = {Hans Zantema},
  year = {2009},
  doi = {10.1007/978-3-642-02348-4_12},
  url = {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},
}

@article{GeserZ99,
  title = {Non-looping string rewriting},
  author = {Alfons Geser and Hans Zantema},
  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},
}

@article{ZantemaB02,
  title = {Sizes of Ordered Decision Trees},
  author = {Hans Zantema and Hans Leo Bodlaender},
  year = {2002},
  doi = {10.1142/S0129054102001205},
  url = {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},
}

@article{GeserMOZ02,
  title = {Relative Undecidability in Term Rewriting: I. The Termination Hierarchy},
  author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema},
  year = {2002},
  doi = {10.1006/inco.2002.3120},
  url = {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},
}

@article{ZantemaG03,
  title = {Transforming equality logic to propositional logic},
  author = {Hans Zantema and Jan Friso Groote},
  year = {2003},
  url = {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},
}