| 2009 |
|---|
| 59 | EE | Jörg Endrullis,
Herman Geuvers,
Hans Zantema:
Degrees of Undecidability in Rewriting
CoRR abs/0902.4723: (2009) |
| 58 | EE | Matthias Raffelsieper,
Hans Zantema:
A Transformational Approach to Prove Outermost Termination Automatically.
Electr. Notes Theor. Comput. Sci. 237: 3-21 (2009) |
| 2008 |
|---|
| 57 | EE | Hans Zantema,
Stefan Wagemans,
Dragan Bosnacki:
Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets.
BIRD 2008: 303-317 |
| 56 | EE | Hans Zantema:
Normalization of Infinite Terms.
RTA 2008: 441-455 |
| 55 | EE | Adam Koprowski,
Hans Zantema:
Certification of Proving Termination of Term Rewriting by Matrix Interpretations.
SOFSEM 2008: 328-339 |
| 54 | EE | René Thiemann,
Hans Zantema,
Jürgen Giesl,
Peter Schneider-Kamp:
Adding constants to string rewriting.
Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008) |
| 53 | EE | Jörg Endrullis,
Johannes Waldmann,
Hans Zantema:
Matrix Interpretations for Proving Termination of Term Rewriting.
J. Autom. Reasoning 40(2-3): 195-220 (2008) |
| 2007 |
|---|
| 52 | EE | Claude Marché,
Hans Zantema:
The Termination Competition.
RTA 2007: 303-313 |
| 51 | EE | Hans Zantema,
Johannes Waldmann:
Termination by Quasi-periodic Interpretations.
RTA 2007: 404-418 |
| 50 | EE | Alfons Geser,
Dieter Hofbauer,
Johannes Waldmann,
Hans Zantema:
On tree automata that certify termination of left-linear term rewriting systems.
Inf. Comput. 205(4): 512-534 (2007) |
| 49 | EE | Bahareh Badban,
Jaco van de Pol,
Olga Tveretina,
Hans Zantema:
Generalizing DPLL and satisfiability for equalities.
Inf. Comput. 205(8): 1188-1211 (2007) |
| 2006 |
|---|
| 48 | EE | Adam Koprowski,
Hans Zantema:
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems.
IJCAR 2006: 332-346 |
| 47 | EE | Jörg Endrullis,
Johannes Waldmann,
Hans Zantema:
Matrix Interpretations for Proving Termination of Term Rewriting.
IJCAR 2006: 574-588 |
| 2005 |
|---|
| 46 | EE | Adam Koprowski,
Hans Zantema:
Proving Liveness with Fairness Using Rewriting.
FroCos 2005: 232-247 |
| 45 | EE | Hans Zantema:
Reducing Right-Hand Sides for Termination.
Processes, Terms and Cycles 2005: 173-197 |
| 44 | EE | Jaco van de Pol,
Hans Zantema:
Generalized Innermost Rewriting.
RTA 2005: 2-16 |
| 43 | EE | Alfons Geser,
Dieter Hofbauer,
Johannes Waldmann,
Hans Zantema:
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems.
RTA 2005: 353-367 |
| 42 | EE | Alfons Geser,
Dieter Hofbauer,
Johannes Waldmann,
Hans Zantema:
Finding finite automata that certify termination of string rewriting systems.
Int. J. Found. Comput. Sci. 16(3): 471-486 (2005) |
| 41 | EE | Hans Zantema:
Termination of String Rewriting Proved Automatically.
J. Autom. Reasoning 34(2): 105-139 (2005) |
| 2004 |
|---|
| 40 | EE | Alfons Geser,
Dieter Hofbauer,
Johannes Waldmann,
Hans Zantema:
Finding Finite Automata That Certify Termination of String Rewriting.
CIAA 2004: 134-145 |
| 39 | EE | Olga Tveretina,
Hans Zantema:
A Proof System and a Decision Procedure for Equality Logic.
LATIN 2004: 530-539 |
| 38 | EE | Hans Zantema:
TORPA: Termination of Rewriting Proved Automatically.
RTA 2004: 95-104 |
| 2003 |
|---|
| 37 | EE | Jürgen Giesl,
Hans Zantema:
Liveness in Rewriting.
RTA 2003: 321-336 |
| 36 | EE | Jan Friso Groote,
Hans Zantema:
Resolution and binary decision diagrams cannot simulate each other polynomially.
Discrete Applied Mathematics 130(2): 157-171 (2003) |
| 35 | EE | Hans Zantema,
Jan Friso Groote:
Transforming equality logic to propositional logic.
Electr. Notes Theor. Comput. Sci. 86(1): (2003) |
| 34 | EE | Jürgen Giesl,
Hans Zantema:
Simulating liveness by reduction strategies.
Electr. Notes Theor. Comput. Sci. 86(4): (2003) |
| 2002 |
|---|
| 33 | EE | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy.
Inf. Comput. 178(1): 101-131 (2002) |
| 32 | EE | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy.
Inf. Comput. 178(1): 132-148 (2002) |
| 31 | EE | Hans Zantema,
Hans L. Bodlaender:
Sizes of Ordered Decision Trees.
Int. J. Found. Comput. Sci. 13(3): 445-458 (2002) |
| 2001 |
|---|
| 30 | EE | Jan Friso Groote,
Hans Zantema:
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially.
Ershov Memorial Conference 2001: 33-38 |
| 29 | EE | Hans Zantema:
The Termination Hierarchy for Term Rewriting.
Appl. Algebra Eng. Commun. Comput. 12(1/2): 3-19 (2001) |
| 28 | | Hans Zantema,
Jaco van de Pol:
A rewriting approach to binary decision diagrams.
J. Log. Algebr. Program. 49(1-2): 61-86 (2001) |
| 2000 |
|---|
| 27 | EE | Jaco van de Pol,
Hans Zantema:
Binary Decision Diagrams by Shard Rewriting.
MFCS 2000: 609-618 |
| 26 | EE | Hans Zantema,
Alfons Geser:
A Complete Characterization of Termination of 0p 1q-> 1r 0s.
Appl. Algebra Eng. Commun. Comput. 11(1): 1-25 (2000) |
| 25 | | Hans Zantema,
Hans L. Bodlaender:
Finding Small Equivalent Decision Trees is Hard.
Int. J. Found. Comput. Sci. 11(2): 343-354 (2000) |
| 1999 |
|---|
| 24 | | Alfons Geser,
Hans Zantema:
Non-looping string rewriting.
ITA 33(3): 279-302 (1999) |
| 1997 |
|---|
| 23 | | Hans Zantema:
Termination of Context-Sensitive Rewriting.
RTA 1997: 172-186 |
| 22 | | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules.
TAPSOFT 1997: 237-248 |
| 21 | EE | Aart Middeldorp,
Hans Zantema:
Simple Termination of Rewrite Systems.
Theor. Comput. Sci. 175(1): 127-158 (1997) |
| 20 | EE | Wan Fokkink,
Hans Zantema:
Termination Modulo Equations by Abstract Commutation with an Application to Iteration.
Theor. Comput. Sci. 177(2): 407-423 (1997) |
| 1996 |
|---|
| 19 | | Aart Middeldorp,
Hitoshi Ohsaki,
Hans Zantema:
Transforming Termination by Self-Labelling.
CADE 1996: 373-387 |
| 18 | | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in Term Rewriting.
CSL 1996: 150-166 |
| 17 | EE | Maria C. F. Ferreira,
Hans Zantema:
Total Termination of Term Rewriting.
Appl. Algebra Eng. Commun. Comput. 7(2): 133-162 (1996) |
| 1995 |
|---|
| 16 | | Maria C. F. Ferreira,
Hans Zantema:
Dummy Elimination: Making Termination Easier.
FCT 1995: 243-252 |
| 15 | | Thomas Arts,
Hans Zantema:
Termination of Logic Programs Using Semantic Unification.
LOPSTR 1995: 219-233 |
| 14 | | H. R. Walters,
Hans Zantema:
Rewrite Systems for Integer Arithmetic.
RTA 1995: 324-338 |
| 13 | | Hans Zantema,
Alfons Geser:
A Complete Characterization of Termination of Op 1q -> 1r Os.
RTA 1995: 41-55 |
| 12 | | Hans Zantema:
Termination of Term Rewriting by Semantic Labelling.
Fundam. Inform. 24(1/2): 89-105 (1995) |
| 11 | | Hans Zantema:
Total Termination of Term Rewriting is Undecidable.
J. Symb. Comput. 20(1): 43-60 (1995) |
| 1994 |
|---|
| 10 | | Maria C. F. Ferreira,
Hans Zantema:
Syntactical Analysis of Total Termination.
ALP 1994: 204-222 |
| 9 | | Aart Middeldorp,
Hans Zantema:
Simple Termination Revisited.
CADE 1994: 451-465 |
| 8 | | Maria C. F. Ferreira,
Hans Zantema:
Well-foundedness of Term Orderings.
CTRS 1994: 106-123 |
| 7 | | Wan Fokkink,
Hans Zantema:
Basic Process Algebra with Iteration: Completeness of its Equational Axioms.
Comput. J. 37(4): 259-268 (1994) |
| 6 | | Hans Zantema:
Termination of Term Rewriting: Interpretation and Type Elimination.
J. Symb. Comput. 17(1): 23-50 (1994) |
| 1993 |
|---|
| 5 | | Maria C. F. Ferreira,
Hans Zantema:
Total Termination of Term Rewriting.
RTA 1993: 213-227 |
| 1992 |
|---|
| 4 | | Hans Zantema:
Type Removal in Term Rewriting.
CTRS 1992: 148-154 |
| 3 | | Hans Zantema:
Termination of Term Rewriting by Interpretation.
CTRS 1992: 155-167 |
| 2 | | Hans Zantema:
Longest Segment Problems.
Sci. Comput. Program. 18(1): 39-66 (1992) |
| 1991 |
|---|
| 1 | | Hans Zantema:
Minimizing Sums of Addition Chains.
J. Algorithms 12(2): 281-307 (1991) |
