| Presentation | 1998/7/30 Introduction to Term Rewriting Systems Yoshihito Toyama, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Terms rewriting systems can offer both flexible computing and effective reasoning with equations, and have been widely applied to automated theorem proving, functional and logic programming, algebraic specification, and symbolic computation. In this paper we first introduce the confluence property, which is certainly one of the most fundamental properties of term rewriting theory, and present applications of term rewriting systems to the field of automated theorem proving. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | term rewriting systems / confluence property / automated theorem proving / completion |
| Paper # | SS98-15 |
| Date of Issue |
| Conference Information | |
| Committee | SS |
|---|---|
| Conference Date | 1998/7/30(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Software Science (SS) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Introduction to Term Rewriting Systems |
| Sub Title (in English) | |
| Keyword(1) | term rewriting systems |
| Keyword(2) | confluence property |
| Keyword(3) | automated theorem proving |
| Keyword(4) | completion |
| 1st Author's Name | Yoshihito Toyama |
| 1st Author's Affiliation | School of Information Science, JAIST() |
| Date | 1998/7/30 |
| Paper # | SS98-15 |
| Volume (vol) | vol.98 |
| Number (no) | 229 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |