Sciweavers

674 search results - page 1 / 135
» Explanation Based Program Transformation
Sort
View
IJCAI
1989
13 years 6 months ago
Explanation Based Program Transformation
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programm...
Maurice Bruynooghe, Luc De Raedt, Danny De Schreye
ALT
1994
Springer
13 years 9 months ago
Explanation-Based Reuse of Prolog Programs
This paper presents a method of extracting subprograms from background knowledge. Most studies on learning logic programs so far developed are mainly concerned with pure Prolog, so...
Yasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa
JMLR
2006
78views more  JMLR 2006»
13 years 4 months ago
Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach
We describe an approach to the inductive synthesis of recursive equations from input/outputexamples which is based on the classical two-step approach to induction of functional Li...
Emanuel Kitzelmann, Ute Schmid
ICML
1989
IEEE
13 years 8 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
DSL
2009
13 years 2 months ago
A DSL for Explaining Probabilistic Reasoning
We propose a new focus in language design where languages provide constructs that not only describe the computation of results, but also produce explanations of how and why those r...
Martin Erwig, Eric Walkingshaw