Combinatorial problems by termination of rewriting

H. Zantema

Combinatorial problems by termination of rewriting

H. Zantema

Formal System Analysis

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

3 Downloads (Pure)

Samenvatting

We give an overview of some combinatorial problems that can be transformed to termination problems on rewriting. Some of them then can be solved by applying state-of-the-art-tools for proving termination automatically, others can not, in this way creating new challenges for future versions of termination tools.

Originele taal-2	Engels
Titel	Proceedings 10th International Workshop on Termination (WST'09, Leipzig, Germany, June 3-5, 2009)
Pagina's	...-...
Status	Gepubliceerd - 2010
Evenement	10th International Workshop on Termination WST 2009 - Duur: 3 jun. 2009 → 5 jun. 2009

Congres

Congres	10th International Workshop on Termination WST 2009
Periode	3/06/09 → 5/06/09

Citeer dit

@inproceedings{f7d875de3b704681a33b784b3827ab97,

title = "Combinatorial problems by termination of rewriting",

abstract = "We give an overview of some combinatorial problems that can be transformed to termination problems on rewriting. Some of them then can be solved by applying state-of-the-art-tools for proving termination automatically, others can not, in this way creating new challenges for future versions of termination tools.",

author = "H. Zantema",

year = "2010",

language = "English",

pages = "...--...",

booktitle = "Proceedings 10th International Workshop on Termination (WST'09, Leipzig, Germany, June 3-5, 2009)",

note = "10th International Workshop on Termination WST 2009 ; Conference date: 03-06-2009 Through 05-06-2009",

}

TY - GEN

T1 - Combinatorial problems by termination of rewriting

AU - Zantema, H.

PY - 2010

Y1 - 2010

N2 - We give an overview of some combinatorial problems that can be transformed to termination problems on rewriting. Some of them then can be solved by applying state-of-the-art-tools for proving termination automatically, others can not, in this way creating new challenges for future versions of termination tools.

AB - We give an overview of some combinatorial problems that can be transformed to termination problems on rewriting. Some of them then can be solved by applying state-of-the-art-tools for proving termination automatically, others can not, in this way creating new challenges for future versions of termination tools.

M3 - Conference contribution

SP - ...-...

BT - Proceedings 10th International Workshop on Termination (WST'09, Leipzig, Germany, June 3-5, 2009)

T2 - 10th International Workshop on Termination WST 2009

Y2 - 3 June 2009 through 5 June 2009

ER -

Combinatorial problems by termination of rewriting

Samenvatting

Congres

Vingerafdruk

Citeer dit