Learn More
We show that the familiar explanation-based generalization (EBG) procedure is applicable to a large family of programming languages, including three families of importance to AI: logic programming (such as Pro-log); lambda calculus (such as LISP); and combinator languages (such as FP). The main application of this result is to extend the algorithm to(More)
In [2], Hanani presents an algorithm to optimize the evaluation of Boolean expressions for each record of a large file. The principal idea is that the operands of the Boolean functions A (AND) and V (OR) can be evaluated in any order because of the commutativity and associa-tivity of the operators; an optimal order, therefore, is one which minimizes the(More)