Add to ORKGWe show that the familiar explanation-based general-ization (EBG) procedure is applicable to a large fam-ily 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 re-sult is to extend the algorithm to domains for which pred-icate calculus is a poor representation. In addition, many issues in analytical learning become clearer and easier to reason about
A number of problems confront standard automatic programming methods. One problem is that the combi...
Jungle evaluation is an approach to define term rewriting with sharing based on graph grammars. This...
"Explanation-Based learning" (EBl) is a technique by which an intelligent system can learn by observ...
Analytical learning is a set of machine learning techniques for revising the representation of a the...
textabstractMany systems are at least partly or implicitly based on term rewriting. Examples are fun...
Proc. 5th Intern. Workshop on Analogical and Inductive Inference for Program SynthesisThis paper pre...
Proc. International Workshop on Inductive Logic Programming (ILP92), 1992The EBG system builds an e...
Implementations of Explanation-Based Generalization (EBG) within a logic-programming environment, as...
Term rewriting has proven to be an important technique in theorem proving. In this paper, we illustr...
Implementations of Explanation-Based Generalization (EBG) within a logic-programming environment, as...
Abstract. We address the problem of an efficient rewriting strategy for general term rewriting syste...
Current explanation-based generalization (EBG) tech-niques can perform badly when the problem being ...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
Programmers don't just have to write programs, they are have to reason about them. Programming langu...
A formalism is elaboration tolerant to the extent that it is convenient to modify a set of facts exp...
A number of problems confront standard automatic programming methods. One problem is that the combi...
Jungle evaluation is an approach to define term rewriting with sharing based on graph grammars. This...
"Explanation-Based learning" (EBl) is a technique by which an intelligent system can learn by observ...
Analytical learning is a set of machine learning techniques for revising the representation of a the...
textabstractMany systems are at least partly or implicitly based on term rewriting. Examples are fun...
Proc. 5th Intern. Workshop on Analogical and Inductive Inference for Program SynthesisThis paper pre...
Proc. International Workshop on Inductive Logic Programming (ILP92), 1992The EBG system builds an e...
Implementations of Explanation-Based Generalization (EBG) within a logic-programming environment, as...
Term rewriting has proven to be an important technique in theorem proving. In this paper, we illustr...
Implementations of Explanation-Based Generalization (EBG) within a logic-programming environment, as...
Abstract. We address the problem of an efficient rewriting strategy for general term rewriting syste...
Current explanation-based generalization (EBG) tech-niques can perform badly when the problem being ...
International audienceWe present a formalism called Addressed Term Rewriting Systems, which can be u...
Programmers don't just have to write programs, they are have to reason about them. Programming langu...
A formalism is elaboration tolerant to the extent that it is convenient to modify a set of facts exp...
A number of problems confront standard automatic programming methods. One problem is that the combi...
Jungle evaluation is an approach to define term rewriting with sharing based on graph grammars. This...
"Explanation-Based learning" (EBl) is a technique by which an intelligent system can learn by observ...