Please use this identifier to cite or link to this item:
doi:10.22028/D291-40426 | Title: | A Method to Prove the Positiveness of Polynomials |
| Author(s): | Steinbach, Joachim |
| Language: | English |
| Year of Publication: | 1991 |
| Place of publication: | Kaiserslautern |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | Termination is an important property for programming and particularly for term rewriting systems. The well-known polynomial orderings can be used for proving the termination of term rewriting systems. The proof of the positiveness of a polynomial presents a crucial point concerning polynomial orderings. There exists a powerful non-deterministic method for performing such proofs that has been developed by BenCherifa and Lescanne. We describe some observations on the time complexity of this approach. In addition, a deterministic version is presented which has the same power as the original one. We also deal with a modification for signatures which do not contain any constant symbols. Finally, we discuss an improvement of the non-deterministic method. |
| Link to this record: | urn:nbn:de:bsz:291--ds-404269 hdl:20.500.11880/37651 http://dx.doi.org/10.22028/D291-40426 |
| Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
| Series volume: | 91,13 |
| Date of registration: | 16-May-2024 |
| Faculty: | SE - Sonstige Einrichtungen |
| Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
| Professorship: | SE - Sonstige |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| SEKI-Report-SR-91-13_Steinbach_A-Method-to-Prove-the-Positiveness-of-Polynomials.pdf | 8,04 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.