Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time
- Jean GallierAffiliated withUniversity of Pennsylvania
- , Paliath NarendranAffiliated withGeneral Electric Company Corporate Research and Development
- , David PlaistedAffiliated withUniversity of North Carolina
- , Stan RaatzAffiliated withRutgers University
- , Wayne SnyderAffiliated withUniversity of Pennsylvania
In this paper, it is shown that there is an algorithm which, given any finite set E of ground equations, produces a reduced canonical rewriting system R equivalent to E in polynomial time. This algorithm based on congruence closure performs simplification steps guided by a total simplification ordering on ground terms, and it runs in time O(n 3).
- Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time
- Book Title
- 9th International Conference on Automated Deduction
- Book Subtitle
- Argonne, Illinois, USA, May 23–26, 1988 Proceedings
- pp 182-196
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
- Author Affiliations
- 1. University of Pennsylvania, 19104, Philadelphia, Pa
- 2. General Electric Company Corporate Research and Development, 12345, Schenectady, N.Y.
- 3. University of North Carolina, 27514, Chapel Hill, N.C.
- 4. Rutgers University, New Brunswick, N.J.
To view the rest of this content please follow the download PDF link above.