{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T23:28:12Z","timestamp":1651534092710},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2004,4,16]],"date-time":"2004-04-16T00:00:00Z","timestamp":1082073600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2004,5]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1017\/s147106840300190x","type":"journal-article","created":{"date-parts":[[2004,4,16]],"date-time":"2004-04-16T10:06:35Z","timestamp":1082109995000},"page":"355-369","source":"Crossref","is-referenced-by-count":2,"title":["Speedup of logic programs by binarization and partial deduction"],"prefix":"10.1017","volume":"4","author":[{"given":"JAN","family":"HR\u016eZA","sequence":"first","affiliation":[]},{"given":"PETER","family":"\u0161T\u011aP\u00c1NEK","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2004,4,16]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S147106840300190X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T19:13:16Z","timestamp":1553886796000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106840300190X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4,16]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S147106840300190X"],"URL":"https:\/\/doi.org\/10.1017\/s147106840300190x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,4,16]]}}}