A comparison between two logical formalisms for rewriting
| dc.creator | Palomino, Miguel | |
| dc.date | 2006-01-06 | |
| dc.date.accessioned | 2026-07-07T06:57:53Z | |
| dc.date.available | 2026-07-07T06:57:53Z | |
| dc.description | Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. Even though it is not possible to establish an entailment system map between them, both can be naturally simulated in each other. Semantically, there is no embedding between the corresponding institutions. Along the way, the notions of entailment and satisfaction in Meseguer's rewriting logic are generalized. We also use the syntactic results to prove reflective properties of CRWL. | |
| dc.description | 31 pages, 2 figures To appear in Theory and Practice of Logic Programming | |
| dc.identifier | https://arxiv.org/abs/cs/0601018 | |
| dc.identifier | http://arxiv.org/abs/cs/0601018 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/107139 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.1.6; F.3.1 | |
| dc.title | A comparison between two logical formalisms for rewriting | |
| dc.type | text |