dblp.uni-trier.dewww.uni-trier.de

Hans Zantema Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
63EEHans Zantema: A Tool Proving Well-Definedness of Streams Using Termination Tools. CALCO 2009: 449-456
62EEJörg Endrullis, Herman Geuvers, Hans Zantema: Degrees of Undecidability in Term Rewriting. CSL 2009: 255-270
61EEHans Zantema: Well-Definedness of Streams by Termination. RTA 2009: 164-178
60EEJörg Endrullis, Herman Geuvers, Hans Zantema: Degrees of Undecidability in Rewriting CoRR abs/0902.4723: (2009)
59EEOlga Tveretina, Carsten Sinz, Hans Zantema: An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas CoRR abs/0909.5038: (2009)
58EEMatthias Raffelsieper, Hans Zantema: A Transformational Approach to Prove Outermost Termination Automatically. Electr. Notes Theor. Comput. Sci. 237: 3-21 (2009)
2008
57EEHans Zantema, Stefan Wagemans, Dragan Bosnacki: Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets. BIRD 2008: 303-317
56EEHans Zantema: Normalization of Infinite Terms. RTA 2008: 441-455
55EEAdam Koprowski, Hans Zantema: Certification of Proving Termination of Term Rewriting by Matrix Interpretations. SOFSEM 2008: 328-339
54EERené Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp: Adding constants to string rewriting. Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008)
53EEJörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reasoning 40(2-3): 195-220 (2008)
2007
52EEClaude Marché, Hans Zantema: The Termination Competition. RTA 2007: 303-313
51EEHans Zantema, Johannes Waldmann: Termination by Quasi-periodic Interpretations. RTA 2007: 404-418
50EEAlfons 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)
49EEBahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema: Generalizing DPLL and satisfiability for equalities. Inf. Comput. 205(8): 1188-1211 (2007)
2006
48EEAdam Koprowski, Hans Zantema: Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. IJCAR 2006: 332-346
47EEJörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR 2006: 574-588
2005
46EEAdam Koprowski, Hans Zantema: Proving Liveness with Fairness Using Rewriting. FroCos 2005: 232-247
45EEHans Zantema: Reducing Right-Hand Sides for Termination. Processes, Terms and Cycles 2005: 173-197
44EEJaco van de Pol, Hans Zantema: Generalized Innermost Rewriting. RTA 2005: 2-16
43EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA 2005: 353-367
42EEAlfons 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)
41EEHans Zantema: Termination of String Rewriting Proved Automatically. J. Autom. Reasoning 34(2): 105-139 (2005)
2004
40EEAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145
39EEOlga Tveretina, Hans Zantema: A Proof System and a Decision Procedure for Equality Logic. LATIN 2004: 530-539
38EEHans Zantema: TORPA: Termination of Rewriting Proved Automatically. RTA 2004: 95-104
2003
37EEJürgen Giesl, Hans Zantema: Liveness in Rewriting. RTA 2003: 321-336
36EEJan Friso Groote, Hans Zantema: Resolution and binary decision diagrams cannot simulate each other polynomially. Discrete Applied Mathematics 130(2): 157-171 (2003)
35EEHans Zantema, Jan Friso Groote: Transforming equality logic to propositional logic. Electr. Notes Theor. Comput. Sci. 86(1): (2003)
34EEJürgen Giesl, Hans Zantema: Simulating liveness by reduction strategies. Electr. Notes Theor. Comput. Sci. 86(4): (2003)
2002
33EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002)
32EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002)
31EEHans Zantema, Hans L. Bodlaender: Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. 13(3): 445-458 (2002)
2001
30EEJan Friso Groote, Hans Zantema: Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially. Ershov Memorial Conference 2001: 33-38
29EEHans 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
27EEJaco van de Pol, Hans Zantema: Binary Decision Diagrams by Shard Rewriting. MFCS 2000: 609-618
26EEHans 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
23EEHans Zantema: Termination of Context-Sensitive Rewriting. RTA 1997: 172-186
22EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248
21EEAart Middeldorp, Hans Zantema: Simple Termination of Rewrite Systems. Theor. Comput. Sci. 175(1): 127-158 (1997)
20EEWan Fokkink, Hans Zantema: Termination Modulo Equations by Abstract Commutation with an Application to Iteration. Theor. Comput. Sci. 177(2): 407-423 (1997)
1996
19EEAart Middeldorp, Hitoshi Ohsaki, Hans Zantema: Transforming Termination by Self-Labelling. CADE 1996: 373-387
18EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. CSL 1996: 150-166
17EEMaria 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
14EEH. R. Walters, Hans Zantema: Rewrite Systems for Integer Arithmetic. RTA 1995: 324-338
13EEHans 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
10EEMaria C. F. Ferreira, Hans Zantema: Syntactical Analysis of Total Termination. ALP 1994: 204-222
9EEAart 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
5EEMaria 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)

Coauthor Index

1Thomas Arts [15]
2Bahareh Badban [49]
3Hans L. Bodlaender [25] [31]
4Dragan Bosnacki [57]
5Jörg Endrullis [47] [53] [60] [62]
6Maria C. F. Ferreira [5] [8] [10] [16] [17]
7Wan Fokkink [7] [20]
8Alfons Geser [13] [18] [22] [24] [26] [32] [33] [40] [42] [43] [50]
9Herman Geuvers [60] [62]
10Jürgen Giesl [34] [37] [54]
11Jan Friso Groote [30] [35] [36]
12Dieter Hofbauer [40] [42] [43] [50]
13Adam Koprowski [46] [48] [55]
14Claude Marché [52]
15Aart Middeldorp [9] [18] [19] [21] [22] [32] [33]
16Enno Ohlebusch [18] [22] [32] [33]
17Hitoshi Ohsaki [19]
18Jaco van de Pol [27] [28] [44] [49]
19Matthias Raffelsieper [58]
20Peter Schneider-Kamp [54]
21Carsten Sinz [59]
22René Thiemann [54]
23Olga Tveretina [39] [49] [59]
24Stefan Wagemans [57]
25Johannes Waldmann [40] [42] [43] [47] [50] [51] [53]
26H. R. Walters [14]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)