4 citations found. Retrieving documents...
Flener P., Popel#nsk# L. #t#p#nkov#: ILP nad Automatic Programming: Towards three approaches. Proc. of 4th Workshop on Inductive Logic Programming (ILP'94), Bad Honeoe, Germany, 1994.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
WiM: A Study on the Top-Down ILP Program - Popelínsky.. (1995)   (Correct)

....is allowed comparing to the other interactive systems [3] 13] The organisation of the paper is as follows. In Section 2. we show one way how to decrease a cardinality of the search space in top down learning algorithms. In Section 3. we revoke the assumption based scenario as introduced in [6, 12] and than we describe WiM program. In Section 4. we review experimental results reached by WiM on good examples. We conclude by exhibiting WiM behaviour on randomly chosen examples. In the folowing section, we try to estimate cardinality of the search space as a function of the size of the ....

....and truth maintenance system which evaluates an acceptability of both the solution found and assumptions, and which is allowed to ask teacher queries. 1 Knowing more about the list 3 predicate we can delete this clause, too. 5 3. 2 Inductive synthesizer As an inductive synthesizer, Markus [6] has been employed, based on Markus system [9, 10] Markus is MIS like [13] non interactive top down synthesizer applying iterative deepening search in a refinement graph and controlling a search space with di#erent parameters. It allows shifting of bias and the definition of a second order ....

[Article contains additional citation context not shown here]

Flener P., Popelnsk L. St#pnkov O.: ILP nad Automatic Programming: Towards three approaches. Proc. of 4th Workshop on Inductive Logic Programming (ILP'94), Bad Hone#, Germany, 1994.


Object-oriented data modelling and rules: ILP meets databases - Popelinsky   (Correct)

....X[managed Y] person:X[boss Z] person:Z[managed Y] In the next two sections we at rst give a short description of the algorithmic ILP system WiM and then we introduce WiM GammaD system. The experimental results obtained by WiM Gamma D are summarized and discussed in Section 6. 4 WiM WiM [8, 20], a program for synthesis of closed Horn clauses from a small example set [8] further elaborates the approach of MIS [22] and Markus [13, 14] It works in top down manner and uses shifting of bias. Three parameters are used for shifting bias the maximum number of free variables in a clause, the ....

....we at rst give a short description of the algorithmic ILP system WiM and then we introduce WiM GammaD system. The experimental results obtained by WiM Gamma D are summarized and discussed in Section 6. 4 WiM WiM [8, 20] a program for synthesis of closed Horn clauses from a small example set [8], further elaborates the approach of MIS [22] and Markus [13, 14] It works in top down manner and uses shifting of bias. Three parameters are used for shifting bias the maximum number of free variables in a clause, the maximum number of goals of a clause body and the complexity of head ....

[Article contains additional citation context not shown here]

Flener P., Popel#nsk# L. #t#p#nkov#: ILP nad Automatic Programming: Towards three approaches. Proc. of 4th Workshop on Inductive Logic Programming (ILP'94), Bad Honeoe, Germany, 1994.


WiM: A Study on the Top-Down ILP Program - Popelínsky..   Self-citation (Popel Nkov)   (Correct)

....is allowed comparing to the other interactive systems [3] 13] The organisation of the paper is as follows. In Section 2. we show one way how to decrease a cardinality of the search space in top down learning algorithms. In Section 3. we revoke the assumption based scenario as introduced in [6, 12] and than we describe WiM program. In Section 4. we review experimental results reached by WiM on good examples. We conclude by exhibiting WiM behaviour on randomly chosen examples. In the folowing section, we try to estimate cardinality of the search space as a function of the size of the ....

....generator of assumptions which generates extensions of the learning set, and truth maintenance system which evaluates an acceptability of both the solution found and assumptions, and which is allowed to ask teacher queries. 3. 2 Inductive synthesizer As an inductive synthesizer, Markus [6] has been employed, based on Markus system [9, 10] Markus is MIS like [13] non interactive top down synthesizer applying iterative deepening search in a re nement graph and controlling a search space with dioeerent parameters. It allows shifting of bias and the de nition of a second order ....

[Article contains additional citation context not shown here]

Flener P., Popel#nsk# L. #t#p#nkov# O.: ILP nad Automatic Programming: Towards three approaches. Proc. of 4th Workshop on Inductive Logic Programming (ILP'94), Bad Honeoe, Germany, 1994.


Towards Program Synthesis From A Small Example Set - Lubo Popelnsk Masaryk (1994)   (1 citation)  (Correct)

No context found.

Flener P., Popel#nsk# L. #t#p#nkov#: ILP nad Automatic Programming: Towards three approaches. Proc. of 4th Workshop on Inductive Logic Programming (ILP'94), Bad Honeoe, Germany, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC