A review of TRS-es
From: Piotr Wyderski (piotr.wyderskiREMOVE_at_wp.pl)
Date: 02/07/04
- Next message: Roberto Grossi: "CFP: 3rd FUN with Algorithms - DEADLINE FEB 27, 2004"
- Previous message: A. Tomaszewski: "A grammar analyser"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sat, 7 Feb 2004 18:31:54 +0100
Hello,
it's a well-known fact that termination and confluence
are undecidable properties when we have an arbitrary
unrestricted Term Rewriting System. But if we restrict
them somehow, it's often possible to decide at least
one of these properties. And here comes my question:
is there a paper which contains a review of known
TRS classes in respect of their properties? Currently
I'm not looking for a detailed theoretical document,
but rather for a review of such classes, i.e. "restrictions
| a short overview of properties". I need it to eliminate
"dead branches" from my research and focus only on
promising alternatives.
Best regards
Piotr Wyderski
- Next message: Roberto Grossi: "CFP: 3rd FUN with Algorithms - DEADLINE FEB 27, 2004"
- Previous message: A. Tomaszewski: "A grammar analyser"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|