Loading...
Please wait, while we are loading the content...
Similar Documents
Generating Polynomial Orderings for Termination Proofs ?
| Content Provider | Semantic Scholar |
|---|---|
| Author | Giesl, J. Urgen |
| Copyright Year | 1995 |
| Abstract | Most systems for the automation of termination proofs using polynomial orderings are only semi-automatic,i.e. the \right" polynomial ordering has to be given by the user. We show that a variation of Lank-ford's partial derivative technique leads to an easier and slightly more powerful method than most other semi-automatic approaches. Based on this technique we develop a method for the automated synthesis of a suited polynomial ordering. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www-i2.informatik.rwth-aachen.de/giesl/papers/rta-report.ps |
| Alternate Webpage(s) | http://www-i2.informatik.rwth-aachen.de/giesl/papers/rta_extended.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |