2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31924Binary 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.15 pages; to appear in Theory and Practice of Logic ProgrammingProgramming LanguagesArtificial IntelligenceD.1.6;I.2.2;I.2.3;F.4.1text