| dc.creator | McAllester, David | |
| dc.date | 2004-10-04T14:24:26Z | |
| dc.date | 2004-10-04T14:24:26Z | |
| dc.date | 1991-12-01 | |
| dc.date.accessioned | 2013-10-09T02:42:09Z | |
| dc.date.available | 2013-10-09T02:42:09Z | |
| dc.date.issued | 2013-10-09 | |
| dc.identifier | AIM-1342 | |
| dc.identifier | http://hdl.handle.net/1721.1/5973 | |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | |
| dc.description | We present a term rewriting procedure based on congruence closure that can be used with arbitrary equational theories. This procedure is motivated by the pragmatic need to prove equations in equational theories where confluence can not be achieved. The procedure uses context free grammars to represent equivalence classes of terms. The procedure rewrites grammars rather than terms and uses congruence closure to maintain certain congruence properties of the grammar. Grammars provide concise representations of large term sets. Infinite term sets can be represented with finite grammars and exponentially large term sets can be represented with linear sized grammars. | |
| dc.format | 21 p. | |
| dc.format | 1916751 bytes | |
| dc.format | 1510872 bytes | |
| dc.format | application/postscript | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.relation | AIM-1342 | |
| dc.subject | context free languages | |
| dc.subject | term rewriting | |
| dc.subject | Knuth-Bendixscompletion | |
| dc.subject | automated reasoning | |
| dc.subject | theorem proving | |
| dc.subject | equational reasoning | |
| dc.title | Grammar Rewriting |
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||