Conference papers of Hans Zantema
- H. Zantema,
Class numbers and units,
in: Computational methods in
number theory, part II, editors H. W. Lenstra and R. Tijdeman,
pages 213 - 234, publisher Mathematisch Centrum Amsterdam,
1982, Mathematical Centre Tracts volume 155
- H. Zantema,
Termination of Term Rewriting: from many-sorted to
one-sorted,
in: Computing Science in the Netherlands, 1991,
editor J. van Leeuwen, volume 2, pages 617 - 629
- H. Zantema,
Type removal in Term Rewriting,
in: Conditional Term
Rewriting Systems, proceedings third international workshop CTRS-92,
1993, editors M. Rusinowitch and J.L. Rémy, Springer
Lecture Notes in Computer Science, volume 656, pages 148 - 154
- H. Zantema,
Termination of Term Rewriting by Interpretation,
in:
Conditional Term
Rewriting Systems, proceedings third international workshop CTRS-92,
1993, editors M. Rusinowitch and J.L. Rémy, Springer
Lecture Notes in Computer Science, volume 656, pages 155 - 167
- V. C. S. Meeussen and H. Zantema,
Derivation lengths in Term Rewriting
from interpretations in the naturals,
in: Computing Science in the
Netherlands, 1993, editor H. A. Wijshoff, pages 249 - 260
- M. C. F. Ferreira and H. Zantema,
Total Termination of Term Rewriting,
in: Proceedings of the 5th Conference on Rewriting Techniques and
Applications, 1993, editor C. Kirchner,
Springer Lecture Notes in Computer Science, volume 690,
pages 213 - 227
- A. Middeldorp and H. Zantema,
Simple Termination Revisited,
in:
Proceedings of the 12th International Conference on Automated Deduction
(CADE12), 1994, editor Alan Bundy,
Springer Lecture Notes in Computer Science, volume 814,
pages 451 - 465
- M. C. F. Ferreira and H. Zantema,
Syntactical Analysis of Total
Termination,
in: Proceedings of the 4th International Conference on
Algebraic and Logic Programming, 1994, editors G. Levi and M.
Rodrigues-Artalejo, Springer Lecture Notes in Computer Science, volume 850,
pages 204 - 222
- M. C. F. Ferreira and H. Zantema,
Dummy Elimination: Making Termination
Easier,
in: Fundamentals of Computation Theory, proceedings 10th
international conference FCT95, 1995, editor H. Reichel,
Springer Lecture Notes in Computer Science, volume 965, pages 243 - 252
- M. C. F. Ferreira and H. Zantema,
Well-foundedness of Term Orderings,
in: Conditional Term Rewriting Systems, proceedings fourth
international workshop CTRS-94, 1995, editor N. Dershowitz,
Springer Lecture Notes in Computer Science, volume 968, pages 106 - 123
- T. Arts and H. Zantema,
Heuristics for Proving Termination using
Rewriting,
in: Proceedings of the 6th Benelux Workshop on Logic Programming
(Benelog'94), Amsterdam, September 1994
- H. Zantema and A. Geser,
A complete characterization of termination of
0^p 1^q -> 1^r 0^s,
in: Proceedings of the 6th Conference on Rewriting
Techniques and Applications, 1995, editor J. Hsiang,
Springer Lecture Notes in Computer Science, volume 914, pages 41 - 55
- H. R. Walters and H. Zantema,
Rewrite Systems for Integer Arithmetic,
in: Proceedings of the 6th Conference on Rewriting
Techniques and Applications, 1995, editor J. Hsiang,
Springer Lecture Notes in Computer Science, volume 914, pages 324 - 338
- W. J. Fokkink and H. Zantema,
Prefix iteration in basic process algebra: Applying termination techniques,
in: proceedings ACP'95, 1995, editors A. Ponse, C. Verhoef and S. F. M. van
Vlijmen, Eindhoven University of Technology, Computing Science Reports
95-14, pages 139 - 156
- T. Arts and H. Zantema,
Termination of Logic Programs Using Semantic Unification,
in: Proceedings of the Fifth International Workshop on Logic Program
Synthesis and Transformation, 1995, editor M. Proietti,
Springer Lecture Notes in Computer Science, volume 1048, pages 219 - 233
-
A. Middeldorp, H. Ohsaki, H. Zantema
Transforming termination by self-labelling,
in: Proceedings of the 13th International Conference on Automated Deduction
(CADE), 1996, editors M.A. McRobbie and J.K. Slaney,
Springer Lecture Notes in Artificial Intelligence, volume 1104, pages 373 - 387
-
A. Geser, A. Middeldorp, E. Ohlebusch, H. Zantema,
Relative undecidability in term rewriting,
In: Proceedings of the Conference of the European Association
of Computer Science Logic (CSL96), 1997,
editor D. van Dalen,
Springer Lecture Notes in Computer Science,
volume 1258,
pages 150 - 166
-
A. Geser, A. Middeldorp, E. Ohlebusch, H. Zantema,
Relative undecidability in the termination hierarchy of
single rewrite rules,
In: Proceedings Theory and Practice of Software Development
(TAPSOFT97, CAAP/FASE), 1997,
editors M. Bidoit and M. Dauchet,
Springer Lecture Notes in Computer Science,
volume 1214,
pages 237 - 248
-
H. Zantema
Termination of context-sensitive rewriting,
in: Proceedings of the 8th Conference on Rewriting Techniques and
Applications (RTA), 1997, editor H. Comon,
Springer Lecture Notes in Computer Science,
volume 1232, pages 172 - 186
-
H. Zantema
Decision Trees: Equivalence and Propositional Operations,
In: Proceedings 10th Netherlands/Belgium Conference on
Artificial Intelligence (NAIC'98),
1998, editors H. La Poutre and J. van den Herik,
pages 157 - 166
-
J. C. van de Pol and H. Zantema
Binary decision diagrams by shared rewriting,
In: Mathematical Foundations of Computer Science, MFCS2000,
2000, editors M. Nielsen and B. Rovan,
Springer Lecture Notes in Computer Science,
volume 1893, pages 609 - 618
-
O. Tveretina and H. Zantema
Comparing techniques for proving unsatisfiability
(extended abstract),
Int. conf. on mathematical methods in electromagnetic theory
(MMET02), 2002, IEEE, volume = 2, pages 605-607
-
J. Giesl and H. Zantema
Liveness in rewriting,
in: Proceedings of the 14th Conference on Rewriting Techniques and
Applications (RTA), 2003, editor R. Nieuwenhuis, Springer Lecture Notes
in Computer Science, volume 2706, pages 321 - 336
-
J. Giesl and H. Zantema
Simulating Liveness by Reduction Strategies,
in: Proceedings of the 3d International Workshop on Reduction
Strategies in Rewriting and Programming (WRS), 2003,
Electronic Notes in Theoretical Computer Science (ENTCS, Elsevier)
, 2003, Volume 86, Issue 4
-
H. Zantema and J. F. Groote
Transforming equality logic to propositional logic,
in: Proceedings of the 4th International Workshop on First-Order
Theorem Proving (FTP), 2003,
Electronic Notes in Theoretical Computer Science (ENTCS, Elsevier)
, 2003, Volume 86, Issue 1
-
W. Wesselink and H. Zantema
Shortest solutions for Sokoban
in: Proceedings 15th Netherlands/Belgium Conference on
Artificial Intelligence (BNAIC'03), 2003
-
O. Tveretina and H. Zantema
A proof system and a decision procedure for equality logic,
in: Proceedings of the 6th Latin American Symposium on Theoretical
Informatics (LATIN), 2004, editor M. Farach-Colton,
Springer Lecture Notes in Computer Science, volume 2976, pages 530 - 539
-
H. Zantema
TORPA: termination of rewriting proved automatically,
in: Proceedings of the 15th Conference on Rewriting Techniques and
Applications (RTA), 2004, editor V. van Oostrom, Springer Lecture Notes
in Computer Science, volume 3091, pages 95 - 104
-
A. Geser and D. Hofbauer and J. Waldmann and H. Zantema
Finding finite automata that certify termination of string rewriting,
in: Revised Selected Papers of Ninth International Conference on Implementation and
Application of Automata (CIAA04), 2005, editors K. Salomaa and S. Yu,
Springer Lecture Notes in Computer Science, volume 3317, pages 134 - 145
-
J. van de Pol and H. Zantema
Generalized innermost rewriting,
in: Proceedings of the 16th Conference on Rewriting Techniques and
Applications (RTA), 2005, editor J. Giesl, Springer Lecture Notes
in Computer Science, volume 3467, pages 2 - 16
-
A. Geser and D. Hofbauer and J. Waldmann and H. Zantema
On tree automata that certify termination of left-linear term rewriting
systems,
in: Proceedings of the 16th Conference on Rewriting Techniques and
Applications (RTA), 2005, editor J. Giesl, Springer Lecture Notes
in Computer Science, volume 3467, pages 353 - 367
-
A. Koprowski and H. Zantema
Proving liveness with fairness using rewriting,
in: Proceedings of the 5th International Workshop on Frontiers of
Combining Systems (FroCoS '05), Vienna, Austria, 2005,
Springer Lecture Notes in Artificial Intelligence 3717, pages 232-247
-
H. Zantema
Reducing Right-Hand Sides for Termination,
in: Processes, Terms and Cycles: Steps on the Road to Infinity:
Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday,
2005, editors: A. Middeldorp, V. van Oostrom, F. van Raamsdonk,
R. de Vrijer,
Springer Lecture Notes in Computer Science, volume 3838, pages
173 - 197
-
A. Koprowski and H. Zantema
Automation of Recursive Path Ordering for Infinite Labelled
Rewrite Systems,
in: Proceedings of the 3rd International Joint Conference on
Automated Reasoning (IJCAR '06), Seattle, USA, 2006,
Springer Lecture Notes in Artificial Intelligence 4130, pages 332-346
-
J. Endrullis and J. Waldmann and H. Zantema
Matrix Interpretations for Proving Termination of Term
Rewriting,
in: Proceedings of the 3rd International Joint Conference on
Automated Reasoning (IJCAR '06), Seattle, USA, 2006,
Springer Lecture Notes in Artificial Intelligence 4130,
pages 574-588
-
C. Marche and H. Zantema
The Termination Competition,
in: Proceedings of the 18th Conference on Rewriting Techniques and
Applications (RTA), 2007, editor F. Baader, Springer Lecture Notes
in Computer Science, volume 4533, pages 303 - 313
-
H. Zantema and J. Waldmann
Termination by Quasi-periodic Interpretation,
in: Proceedings of the 18th Conference on Rewriting Techniques and
Applications (RTA), 2007, editor F. Baader, Springer Lecture Notes
in Computer Science, volume 4533, pages 404 - 418
-
H. Zantema
Normalization of Infinite Terms,
in: Proceedings of the 19th Conference on Rewriting Techniques and
Applications (RTA), 2008, editor A. Voronkov, Springer Lecture Notes
in Computer Science, volume 5117, pages 441 - 455
-
H. Zantema and S. Wagemans and D. Bosnacki,
Finding Frequent Subgraphs in Biological Networks via Maximal Item Sets,
in: Proceedings of the 2nd Conference on BioInformatics Research and Development
(BIRD), 2008, editors R. Murphy and R. Wagner, Springer Lecture Notes
in Computer Science
-
A. Koprowski and H. Zantema,
Certification of proving
termination of term rewriting by matrix interpretations,
Proceedings 34th Conference on Theory and Practice of
Computer Science (SOFSEM), 2008, Springer Lecture Notes in
Computer Science, volume 4910, pages 328-339
-
M. Raffelsieper and H. Zantema,
A transformational
approach to prove outermost termination automatically,
Proceedings
of the 8th International Workshop on Reduction Strategies in
Rewriting and Programming (WRS 2008), 2009,
Electronic Notes in Theoretical Computer Science,
volume 237, pages 3-21
-
H. Zantema,
Well-definedness of Streams by Termination,
Proceedings of the 20th Conference on Rewriting Techniques and
Applications (RTA), 2009,
editor R. Treinen,
Springer Lecture Notes in Computer Science, volume 5595, pages
164-178
-
H. Zantema,
A tool proving well-definedness of streams using termination
tools,
Proceedings of the 3rd International Conference on Algebra and
Coalgebra in Computer Science (CALCO), 2009,
Springer Lecture Notes in Computer Science, volume 5728, pages
449-456
-
H. Zantema,
Complexity of Guided Insertion-Deletion in RNA-editing,
Proceedings of the 4th International Conference on Language and
Automata Theory and Applications (LATA), 2010,
Springer Lecture Notes in Computer Science, volume 6031, pages 608-619
-
H. Zantema and M. Raffelsieper,
Proving Productivity in Infinite Data Structures,
Proceedings of the 21st International Conference on Rewriting Techniques
and Applications (RTA), 2010, Leibniz International Proceedings in
Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer
Informatik, volume 6, pages 401-416
-
H. Zantema and J. Endrullis,
Proving Equality of Streams Automatically,
Proceedings of the 22st International Conference on Rewriting Techniques
and Applications (RTA), 2011, Leibniz International Proceedings in
Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer
Informatik, volume 10, pages 393-408
-
H. Zantema,
Strategy independent reduction lengths in rewriting and binary arithmetic,
Proceedings of the 10th International Workshop in Reduction Strategies in Rewriting and Programming (WRS 11),
2012, Electronic Proceedings in Theoretical Computer Science,
volume 82, pages 69-76
-
E.P de Vink, H. Zantema and D. Bosnacki,
Combining insertion and deletion in {RNA}-editing preserves regularity,
Proceedings of the 6th Workshop on Membrane Computing and Biologically Inspired Process
Calculi (McCBIC 2012), 2012, Electronic Proceedings in Theoretical Computer Science,
volume 100, pages 48-62
-
V. van Oostrom and H. Zantema,
Triangulation in Rewriting,
Proceedings of the 23rd International Conference on Rewriting Techniques
and Applications (RTA), 2012, Leibniz International Proceedings in
Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer
Informatik, volume 15, pages 240-255
-
M.H.L. Bodlaender, C.A.J. Hurkens, V. Kusters, F. Staals, G.J. Woeginger and H. Zantema,
Cinderella versus the Wicked Stepmother,
Proceedings of the 7th International Conference on Theoretical Computer Science (TCS), 2012,
Springer Lecture Notes in Computer Science, volume 7604, pages 57-71
-
N.A.W. van Riel, H. Zantema, D. Bosnacki and P.A.J. Hilbers,
SMT-based analysis of a Boolean model
of inflammation,
Proceedings of the 14th International Conference on Systems Biology (ICSB), 2013, August 30-
September 3, Copenhagen
- S.J.C. Joosten and H. Zantema,
Relaxation of 3-partition instances,
12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, 2013, May
21-23, pages 133-136
-
H. Zantema, H.J.S. Bruggink and B. Koenig,
Termination of cycle rewriting ,
Proceedings of Joint International Conference, RTA-TLCA 2014,
Vienna, Austria, July 14-17, 2014,
Springer Lecture Notes in Computer Science 8560, pages 476-490
- H.J.S. Bruggink, B. Koenig and H. Zantema,
Termination analysis for graph transformation systems,
Proceedings of the 8th IFIP TCS International Conference, TCS
2014, Rome, Italy, September 1-3, 2014,
Springer Lecture Notes in Computer Science 8705, pages 179-194
- H.J.S. Bruggink B. Koenig, D.Nolte and H. Zantema,
Proving termination of graph transformation systems using weighted type graphs over semirings,
Proceedings of Graph Transformation, 8th International Conference, ICGT,
2015, Springer Lecture Notes in Computer Science 9151, pages 52-68
- J. Endrullis and H. Zantema,
Proving non-termination by finite automata,
Rewriting Techniques and Applications RTA,
2015, LIPIcs: Leibniz International Proceedings in Informatics, No. 36, pages 160-176
- R.P.J. Koolen, T.A.C. Willemse and H. Zantema,
Using SMT for solving fragments of parameterised Boolean equation systems,
Automated Technology for Verification and Analysis (13th International Symposium, ATVA 2015),
2015, Springer Lecture Notes in Computer Science 9364, pages 14-30
- D. Sabel and H. Zantema,
Transforming cycle rewriting into string rewriting,
Rewriting Techniques and Applications RTA,
2015, LIPIcs: Leibniz International Proceedings in Informatics, No. 36, pages 285-300
- Endrullis, J. and Grabmayer, C. and Hendriks, D. and Zantema, H.,
The Degree of Squares is an Atom,
Combinatorics on Words: 10th
International Conference, WORDS 2015, Kiel,Germany, September 14-17,
Manea, F. and Nowotka, D.i, editors, Springer Lecture Notes in Computer Science, volume 9304,
year 2015, pages 109--121
- H. Don and H. Zantema,
Finding DFAs with maximal shortest synchronizing word length,
Proceedings of the 11th International Conference on Language and
Automata Theory and Applications (LATA), 2017,
Springer Lecture Notes in Computer Science, volume 10168, pages 249-260
- M. de Bondt, H. Don and H. Zantema,
DFAs and PFAs with long shortest synchronizing word length,
Proceedings of the 21st International Conference on Developments of Language
Theory (DLT), 2017,
Springer Lecture Notes in Computer Science, volume 10396, pages 122-133
- H. Zantema and W. Bosma,
Classifying non-periodic sequences by permutation transducers,
Proceedings of the 21st International Conference on Developments of Language
Theory (DLT), 2017,
Springer Lecture Notes in Computer Science, volume 10396, pages 365-377
- H. Zantema,
Complexity of automatic sequences,
Proceedings of the 14th International Conference on Language and
Automata Theory and Applications (LATA), 2020,
Springer Lecture Notes in Computer Science, volume 12038, pages 260-271
Honored by best paper award
- H. Zantema,
Passive automata learning: DFAs and NFAs,
A Journey from Process Algebra via Timed Automata to Model Learning, essays dedicated to Frits Vaandrage on the occasion of his 60th birthday, 2022,
Springer Lecture Notes in Computer Science, volume 13560, pages 575-580