Encapsulation for Practical Simplification Procedures
| dc.creator | Matlin, Olga Shumsky | |
| dc.creator | McCune, William | |
| dc.date | 2004-02-03 | |
| dc.date.accessioned | 2026-07-07T03:20:52Z | |
| dc.date.available | 2026-07-07T03:20:52Z | |
| dc.description | ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a resolution/paramodulation theorem proving system. Term rewriting is at the core of the two procedures, but details of the rewriting procedure itself are irrelevant. The ACL2 encapsulate construct was used to assert the existence of the rewriting function and to state some of its properties. Termination, irreducibility, and soundness properties were established for each procedure. The availability of the encapsulation mechanism in ACL2 is considered essential to rapid and efficient verification of this kind of algorithm. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0402010 | |
| dc.identifier | http://arxiv.org/abs/cs/0402010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31984 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.3.1; F.4.1 | |
| dc.title | Encapsulation for Practical Simplification Procedures | |
| dc.type | text |