Speedup of Logic Programs by Binarization and Partial Deduction
| dc.creator | Hruza, Jan | |
| dc.creator | Stepanek, Petr | |
| dc.date | 2003-12-15 | |
| dc.date.accessioned | 2026-07-07T03:20:43Z | |
| dc.date.available | 2026-07-07T03:20:43Z | |
| dc.description | Binary logic programs can be obtained from ordinary logic programs by a binarizing transformation. In most cases, binary programs obtained this way are less efficient than the original programs. (Demoen, 1992) showed an interesting example of a logic program whose computational behaviour was improved when it was transformed to a binary program and then specialized by partial deduction. The class of B-stratifiable logic programs is defined. It is shown that for every B-stratifiable logic program, binarization and subsequent partial deduction produce a binary program which does not contain variables for continuations introduced by binarization. Such programs usually have a better computational behaviour than the original ones. Both binarization and partial deduction can be easily automated. A comparison with other related approaches to program transformation is given. | |
| dc.description | 15 pages; to appear in Theory and Practice of Logic Programming | |
| dc.identifier | https://arxiv.org/abs/cs/0312026 | |
| dc.identifier | http://arxiv.org/abs/cs/0312026 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31924 | |
| dc.subject | Programming Languages | |
| dc.subject | Artificial Intelligence | |
| dc.subject | D.1.6;I.2.2;I.2.3;F.4.1 | |
| dc.title | Speedup of Logic Programs by Binarization and Partial Deduction | |
| dc.type | text |