2003/12/15 by Jan Hruza, Jan Hrůza, Hruza, Jan +3
Computer Science · #Artificial Intelligence (cs.AI) #D.1.6 #F.4.1 #FOS: Computer and information sciences #Formal Methods in Verification #I.2.2 #I.2.3 #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL) #cs.AI #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/0312026
15 pages; to appear in Theory and Practice of Logic Programming
arxiv created 2003/12/15 · openalex publication_date 2003/12/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.