Equivalences of logic programs
Proceedings on Third international conference on logic programming
Making exhaustive search programs deterministic
New Generation Computing
New Generation Computing
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Stratification of definite clause programs and of general logical programs
CSL '89 Proceedings of the third workshop on Computer science logic
Partial evaluation in logic programming
Journal of Logic Programming
Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs
PLILP '91 Selected papers of the symposium on Programming language implementation and logic programming
From logic programming to Prolog
From logic programming to Prolog
PLILP '90 Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming
BinProlog: a Continuation Passing Style Prolog Engine
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Redundant Argument Filtering of Logic Programs
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
| Hi-index | 0.00 |
Binary logic programs can be obtained from ordinary logic programs by a binarizing transformation. In most cases, binary programs obtained by this way are less efficient than the original programs. Demoen [2] showed an interesting example of a logic program whose computational behavior was improved if it was transformed to a binary program and then specialized by partial deduction. The class of so called 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 usually has a better computational behavior than the original one. Both binarization and partial deduction can be automated.