Automatic generation of polynomial orderings in rewrite systems


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 9, pp. 2431-2441, Sep. 1999
10.3745/KIPSTE.1999.6.9.2431,   PDF Download:

Abstract

Equations are widely used in representing information. One of the basic questions about equations is to determine whether a given equation follows logically from the set of equations. Rewrite systems are one of the method to answer many instances of this problem. A rewrite system simplifies a given term by applying rewrite rules successively. Hence it is important that the process of simplification does not go on indefinitely. One of the methods to check whether a rewrite system terminates (that is, the rewrite system does not simplify any term indefinitely) is polynomial orderings. A polynomial ordering assigns an appropriate polynomial to each function symbol. However, how to assign polynomials to function symbols is not known. We propose an automatic way of generating polynomial orderings using genetic algorithms.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. J. Mi, S. J. Kwon, W. K. Bum, "Automatic generation of polynomial orderings in rewrite systems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 9, pp. 2431-2441, 1999. DOI: 10.3745/KIPSTE.1999.6.9.2431.

[ACM Style]
Lee Jung Mi, Suh Jae Kwon, and Wee Kyu Bum. 1999. Automatic generation of polynomial orderings in rewrite systems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 9, (1999), 2431-2441. DOI: 10.3745/KIPSTE.1999.6.9.2431.