• 1237 Citaties
1980 …2019

Research output per year

Als u wijzigingen in Pure hebt gemaakt, zullen deze hier binnenkort zichtbaar zijn.

Onderzoeksoutput

Filter
Conferentiebijdrage
2017

Classifying non-periodic sequences by permutation transducers

Zantema, H. & Bosma, W., 2017, Developments in Langauge Theory"21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. Charlier, E., Leroy, J. & Rigo, M. (redactie). Cham: Springer, blz. 365-377 13 blz. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10396 LNCS).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)

DFAs and PFAs with long shortest synchronizing word length

de Bondt, M., Don, H. & Zantema, H., 2017, Developments in Language Theory : 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. Charlier, E., Leroy, J. & Rigo, M. (redactie). Dordrecht: Springer, blz. 122-133 12 blz. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10396 LNCS).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

6 Citaten (Scopus)

Finding DFAs with maximal shortest synchronizing word length

Zantema, H. & Don, H., 2017, Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings: 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings. Drewes, F., Martín-Vide, C. & Truthe, B. (redactie). Dordrecht: Springer, blz. 249-260 12 blz. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10168 LNCS).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
2015

Proving non-termination by finite automata

Endrullis, J. & Zantema, H., 2015, Rewriting Techniques and Applications (26th International Conference, RTA'15, Warsaw, Poland, June 29-July 3, 2015). Fernández, M. (redactie). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, blz. 160-176 (LIPIcs: Leibniz International Proceedings in Informatics; vol. 36).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Bestand
7 Citaten (Scopus)
18 Downloads (Pure)

Proving termination of graph transformation systems using weighted type graphs over semirings

Bruggink, H. J. S., König, B., Nolte, D. & Zantema, H., 2015, Graph Transformation (8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings). Parisi-Presicce, F. & Westfechtel, B. (redactie). Cham: Springer, blz. 52-68 (Lecture Notes in Computer Science; vol. 9151).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

5 Citaten (Scopus)
3 Downloads (Pure)

The degree of squares is an atom

Endrullis, J., Grabmayer, C. A., Hendriks, D. & Zantema, H., 2015, Combinatorics on Words: 10th International Conference, WORDS 2015. Amsterdam: Springer, blz. 109-121 13 blz. (Lecture Notes in Computer Science).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

5 Citaten (Scopus)

Transforming cycle rewriting into string rewriting

Sabel, D. & Zantema, H., 2015, Rewriting Techniques and Applications (26th International Conference, RTA'15, Warsaw, Poland, June 29-July 3, 2015). Fernández, M. (redactie). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, blz. 285-300 (LIPIcs: Leibniz International Proceedings in Informatics; vol. 36).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
2 Downloads (Pure)

Using SMT for solving fragments of parameterised Boolean equation systems

Koolen, R. P. J., Willemse, T. A. C. & Zantema, H., 2015, Automated Technology for Verification and Analysis (13th International Symposium, ATVA 2015, Shanghai, China, October 12-15, 2015). Finkbeiner, B., Pu, G. & Zhang, L. (redactie). Springer, blz. 14-30 (Lecture Notes in Computer Science; vol. 9364).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

5 Citaten (Scopus)
5 Downloads (Pure)
2014

Termination analysis for graph transformation systems

Bruggink, H. J. S., König, B. & Zantema, H., 2014, Theoretical Computer Science (8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings). Diaz, J., Lanese, I. & Sangiorgi, D. (redactie). Berlin: Springer, blz. 179-194 (Lecture Notes in Computer Science; vol. 8705).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

8 Citaten (Scopus)
2 Downloads (Pure)

Termination of cycle rewriting

Zantema, H., König, B. & Bruggink, H. J. S., 2014, Rewriting and Typed Lambda Calculi (Joint International Conference, RTA-TLCA 2014, Vienna, Austria, July 14-17, 2014. Proceedings). Dowek, G. (redactie). Berlin: Springer, blz. 476-490 (Lecture Notes in Computer Science; vol. 8560).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

9 Citaten (Scopus)
2 Downloads (Pure)
2013

Relaxation of 3-partition instances

Joosten, S. J. C. & Zantema, H., 2013, 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (Enschede, Netherlands, May 21-23, 2013). Cornelissen, K., Hoeksma, R., Hurink, J. & Manthey, B. (redactie). blz. 133-136 (CTIT Workshop Proceedings Series; vol. WP 13-01).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Bestand
29 Downloads (Pure)
2012

Cinderella versus the Wicked Stepmother

Bodlaender, M. H. L., Hurkens, C. A. J., Kusters, V. J. J., Staals, F., Woeginger, G. J. & Zantema, H., 2012, Theoretical Computer Science (7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings). Baeten, J. C. M., Ball, T. & Boer, de, F. S. (redactie). Berlin: Springer, blz. 57-71 (Lecture Notes in Computer Science; vol. 7604).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

9 Citaten (Scopus)
2 Downloads (Pure)

Combining insertion and deletion in RNA-editing preserves regularity

Vink, de, E. P., Zantema, H. & Bosnacki, D., 2012, Proceedings of the 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi (McCBIC 2012, Newcastle, UK, September 8, 2012). Ciobanu, G. (redactie). EPTCS, blz. 48-62 (Electronic Proceedings in Theoretical Computer Science; vol. 100).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Downloads (Pure)

Strategy independent reduction lengths in rewriting and binary arithmetic

Zantema, H., 2012, Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011, Novi Sad, Serbia, May 29, 2011). Escobar, S. (redactie). EPTCS, blz. 69-76 (Electronic Proceedings in Theoretical Computer Science; vol. 82).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Downloads (Pure)

Triangulation in rewriting

Oostrom, van, V. & Zantema, H., 2012, 23rd International Conference on Rewriting Techniques and Applications (RTA'12, Nagoya, Japan, May 28-June 2, 2012). Tiwari, A. (redactie). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, blz. 240-255 (LIPIcs: Leibniz International Proceedings in Informatics; vol. 15).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
2 Downloads (Pure)
2011

Proving equality of streams automatically

Zantema, H. & Endrullis, J., 2011, Proceedings of the 22nd International Conference on Rewriting Techniques and Applications (RTA 2011, Novi Sad, Serbia, May 30-June 1, 2011). Schmidt-Schlauß, M. (redactie). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, blz. 393-408 (LIPIcs: Leibniz International Proceedings in Informatics; vol. 10).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Bestand
7 Citaten (Scopus)
26 Downloads (Pure)

Strategy independent reduction lengths in rewriting and binary arithmetic

Zantema, H., 2011, Reduction Strategies in Rewriting and Programming (10th International Workshop, WRS 2011, Novi Sad, Serbia, May 29, 2011. Informal proceedings). Escobar, S. (redactie). Valencia: Universidad Politechnica de Valencia, blz. 41-45

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Bestand
58 Downloads (Pure)
2010

Combinatorial problems by termination of rewriting

Zantema, H., 2010, Proceedings 10th International Workshop on Termination (WST'09, Leipzig, Germany, June 3-5, 2009). blz. ...-...

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Downloads (Pure)

Complexity of guided insertion-deletion in RNA-editing

Zantema, H., 2010, Language and Automata Theory and Applications (4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings). Dediu, A. H., Fernau, H. & Martin-Vide, C. (redactie). Berlin: Springer, blz. 608-619 (Lecture Notes in Computer Science; vol. 6031).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
2 Downloads (Pure)

Order-independence of vector-based transition systems

Raffelsieper, M., Mousavi, M. R. & Zantema, H., 2010, Proceedings 10th International Conference on Application of Concurrency to System Design (ACSD'10, Braga, Portugal, June 21-25, 2010). IEEE Computer Society, blz. 115-123

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)
2 Downloads (Pure)

Proving productivity in infinite data structures

Zantema, H. & Raffelsieper, M., 2010, Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010, Edinburgh, Scotland, July 11-13, 2010). Lynch, C. (redactie). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, blz. 401-416 (LIPIcs: Leibniz International Proceedings in Informatics; vol. 6).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

12 Citaten (Scopus)
2 Downloads (Pure)

Stream productivity by outermost termination

Zantema, H. & Raffelsieper, M., 2010, Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming (WRS'09, Brasilia, Brazil, June 28, 2009). Fernández, M. (redactie). blz. 83-95 (Electronic Proceedings in Theoretical Computer Science; vol. 15).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

5 Citaten (Scopus)
2 Downloads (Pure)
2009

An exponential lower bound on OBDD refutations for pigeonhole formulas

Tveretina, O., Sinz, C. & Zantema, H., 2009, Proceedings 4th Athens Colloquium on Algorithms and Complexity (ACAC 2009, Athens, Greece, August 20-21, 2009). Markakis, E. & Milis, I. (redactie). s.n., blz. 13-21 (Electronic Proceedings in Theoretical Computer Science; vol. 4).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

4 Citaten (Scopus)
2 Downloads (Pure)

A tool proving well-definedness of streams using termination tools

Zantema, H., 2009, Algebra and Coalgebra in Computer Science (Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings). Kurz, A., Lenisa, M. & Tarlecki, A. (redactie). Berlin: Springer, blz. 449-456 (Lecture Notes in Computer Science; vol. 5728).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
2 Downloads (Pure)

A transformational approach to prove outermost termination automatically

Raffelsieper, M. & Zantema, H., 2009, Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2008, Castle of Hagenberg, Austria, July 14, 2008). Middeldorp, A. (redactie). blz. 3-21 (Electronic Notes in Theoretical Computer Science; vol. 237).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

10 Citaten (Scopus)
2 Downloads (Pure)

Degrees of undecidability in term rewriting

Endrullis, J., Geuvers, J. H. & Zantema, H., 2009, Computer Science Logic (23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings). Grädel, E. & Kahle, R. (redactie). Berlin: Springer, blz. 255-270 (Lecture Notes in Computer Science; vol. 5771).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

11 Citaten (Scopus)
2 Downloads (Pure)

Formal analysis of non-determinism in Verilog cell library simulation models

Raffelsieper, M., Mousavi, M. R., Roorda, J. W., Strolenberg, C. & Zantema, H., 2009, Formal Methods for Industrial Critical Systems (14th International Workshop, FMICS 2009, Eindhoven, The Netherlands, November 2-3, 2009. Proceedings). Alpuente, M., Cook, B. & Joubert, C. (redactie). Berlin: Springer, blz. 133-148 (Lecture Notes in Computer Science; vol. 5825).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

6 Citaten (Scopus)
3 Downloads (Pure)

Well-definedness of streams by termination

Zantema, H., 2009, Rewriting Techniques and Applications (20th International Conference, RTA 2009, Brasília, Brazil, June 29-July 1, 2009, Proceedings). Treinen, R. (redactie). Berlin: Springer, blz. 164-178 (Lecture Notes in Computer Science; vol. 5595).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Bestand
11 Citaten (Scopus)
59 Downloads (Pure)
2008

Certification of proving termination of term rewriting by matrix interpretations

Koprowski, A. & Zantema, H., 2008, SOFSEM 2008 : Theory and Practice of Computer Science (Proceedings 34th Conference, Nový Smokovec, Slovakia, January 19-25, 2008). Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P. & Bieliková, M. (redactie). Berlin: Springer, blz. 328-339 (Lecture Notes in Computer Science; vol. 4910).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

6 Citaten (Scopus)
2 Downloads (Pure)

Finding frequent subgraphs in biological networks via maximal item sets

Zantema, H., Wagemans, S. & Bosnacki, D., 2008, Bioinformatics Research and Development (2nd International Conference, BIRD'08, Vienna, Austria, July 7-9, 2008, Proceedings). Elloumi, M., Küng, J., Linial, M., Murphy, R., Schneider, K. & Toma, C. (redactie). Berlin: Springer, blz. 303-317 (Communications in Computer and Information Science; vol. 13).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Citaten (Scopus)
3 Downloads (Pure)

Normalization of infinite terms

Zantema, H., 2008, Rewriting Techniques and Applications (19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings). Voronkov, A. (redactie). Berlin: Springer, blz. 441-455 (Lecture Notes in Computer Science; vol. 5117).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

12 Citaten (Scopus)
2 Downloads (Pure)
2007

Termination by quasi-periodic interpretations

Zantema, H. & Waldmann, J., 2007, Proceedings of the 18th International Conference on Term Rewriting and Applications (RTA 2007) 26-28 June 2007, Paris, France. Baader, F. (redactie). Springer, blz. 404-418 (Lecture Notes in Computer Science; vol. 4533).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Bestand
3 Citaten (Scopus)
56 Downloads (Pure)

The Termination Competition

Marché, C. & Zantema, H., 2007, Proceedings of the 18th International Conference on Term Rewriting and Applications (RTA 2007) 26-28 June 2007, Paris, France. Baader, F. (redactie). Berlin, Germany: Springer, blz. 303-313 (Lecture Notes in Computer Science; vol. 4533).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageProfessioneel

Open Access
Bestand
17 Citaten (Scopus)
79 Downloads (Pure)
2006

Automation of recursive path ordering for infinite labelled rewrite systems

Koprowski, A. & Zantema, H., 2006, Automated Reasoning (Proceedings 3rd International Joint Conference, IJCAR'06, Seattle WA, USA, August 17-20, 2006). Shankar, N. & Furbach, U. (redactie). Berlin: Springer, blz. 332-346 (Lecture Notes in Computer Science; vol. 4130).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
2 Downloads (Pure)

Matrix interpretations for proving termination of term rewriting

Endrullis, J., Waldmann, J. & Zantema, H., 2006, Automated reasoning : 3rd international joint conference, IJCAR'06, Seattle WA, USA, August 17-20, 2006 : proceedings. Furbach, U. & Shankar, N. (redactie). Berlin: Springer, blz. 574-588 (Lecture Notes in Computer Science; vol. 4130).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

6 Citaten (Scopus)
2 Downloads (Pure)

Termination of extended string rewriting

Zantema, H., 2006, Proceedings Eighth International Workshop on Termination (WST 2006, Seattle WA, USA, August 15-16, 2006). Geser, A. & Sondergaard, H. (redactie). blz. 44-48

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademic

1 Downloads (Pure)

The termination competition 2006

Marché, C. & Zantema, H., 2006, Proceedings Eighth International Workshop on Termination (WST 2006, Seattle WA, USA, August 15-16, 2006). Geser, A. & Sondergaard, H. (redactie). S.l.: Computing Research Repository, blz. 32-38

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageProfessioneel

2 Downloads (Pure)
2005

Finding finite automata that certify termination of string rewriting

Geser, A., Hofbauer, D., Waldmann, J. & Zantema, H., 2005, Implementation and Application of Automata (Revised Selected Papers, Ninth International Conference, CIAA 2004, Kingston ON, Canada, July 22-24, 2004). Domaratzki, M., Okhotin, A., Salomaa, K. & Yu, S. (redactie). Berlin: Springer, blz. 134-145 (Lecture Notes in Computer Science; vol. 3317).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Citaten (Scopus)
2 Downloads (Pure)

Generalized innermost rewriting

Pol, van de, J. C. & Zantema, H., 2005, Rewriting Techniques and Applications (Proceedings 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005). Giesl, J. (redactie). Berlin: Springer, blz. 2-16 (Lecture Notes in Computer Science; vol. 3467).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)
2 Downloads (Pure)

On tree automata that certify termination of left-linear term rewriting systems

Geser, A., Hofbauer, D., Waldmann, J. & Zantema, H., 2005, Rewriting Techniques and Applications (Proceedings 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005). Giesl, J. (redactie). Berlin: Springer, blz. 353-367 (Lecture Notes in Computer Science; vol. 3467).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

11 Citaten (Scopus)
2 Downloads (Pure)

Proving liveness with fairness using rewriting

Koprowski, A. & Zantema, H., 2005, Frontiers of Combining Systems (Proceedings 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005). Gramlich, B. (redactie). Berlin: Springer, blz. 232-247 16 blz. (Lecture Notes in Computer Science (LNCS); vol. 3717)(Lecture Notes in Artificial Intelligence (LNAI); vol. 3717).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

5 Citaten (Scopus)
2004

A proof system and a decision procedure for equality logic

Tveretina, O. & Zantema, H., 2004, LATIN 2004: Theoretical Informatics (Proceedings 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004). Farach-Colton, M. (redactie). Berlin: Springer, blz. 530-539 (Lecture Notes in Computer Science; vol. 2976).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)
2 Downloads (Pure)

Relative termination in term rewriting

Zantema, H., 2004, Proceedings 7th International Workshop on Termination (WST-04, Aachen, Germany, June 1-2, 2004), Aachener Informatik Berichte AIB-2004-07. Codish, M. & Middelkoop, A. (redactie). Aachen, Germany: RWTH, blz. 51-54

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademic

2 Downloads (Pure)

Solving satisfiability of ground term algebras using DPLL and unification

Badban, B., Pol, van de, J. C., Tveretina, O. & Zantema, H., 2004, Proceedings 18th Workshop on Unification (UNIF2004, Cork, Ireland, July 5, 2004; affiliated with IJCAR'04). Kohlhase, M. (redactie).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademic

2 Downloads (Pure)

TORPA : termination of rewriting proved automatically

Zantema, H., 2004, Rewriting techniques and applications : proceedings 15th international conference, RTA 2004, Aachen, Germany, June 3-5, 2004. Oostrom, van, V. (redactie). Berlin: Springer, blz. 95-104 (Lecture Notes in Computer Science; vol. 3091).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

12 Citaten (Scopus)
2 Downloads (Pure)

Tree automata that certify termination of term rewriting systems

Geser, A., Hofbauer, D., Waldmann, J. & Zantema, H., 2004, Proceedings 7th International Workshop on Termination (WST-04, Aachen, Germany, June 1-2, 2004), Aachener Informatik Berichte AIB-2004-07. Codish, M. & Middelkoop, A. (redactie). Aachen, Germany: RWTH, blz. 14-17

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademic

2 Downloads (Pure)
2003

Liveness in rewriting

Giesl, J. & Zantema, H., 2003, Rewriting techniques and applications : 14th international conference, RTA 2003, Valencia, Spain, June 9-11, 2003 : proceedings. Nieuwenhuis, R. (redactie). Berlin: Springer, blz. 321-336 (Lecture Notes in Computer Science; vol. 2706).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

13 Citaten (Scopus)
2 Downloads (Pure)

Proving liveness in ring protocols by termination

Zantema, H. & Giesl, J., 2003, Proceedings 6th International Workshop on Termination (WST2003, Valencia, Spain, June 13-14, 2003), Technical Report DSIC-II/15/03. Rubio, A. (redactie). Valencia: Universidad Politecnica de Valencia, blz. 16-18

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademic

Shortest solutions for Sokoban

Wesselink, J. W. & Zantema, H., 2003, Proceedings 15th Netherlands/Belgium Conference on Artificial Intelligence (BNAIC'03, Nijmegen, The Netherlands, October 23-24, 2003). Heskes, T. & et al., X. (redactie). Nijmegen: SNN/KUN, blz. 323-330

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademic

Simulating liveness by reduction strategies

Giesl, J. & Zantema, H., 2003, Proceedings 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003, Valencia, Spain, June 8, 2003). Gramlich, B. & Lucas, S. (redactie). (Electronic Notes in Theoretical Computer Science; vol. 86(4)).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Citaten (Scopus)