Flener P. and Deville Y.: Logic program synthesis from incomplete specications. Journal of Symbolic Computation, 15(56):775805, May/June 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Logic Program Synthesis in a Higher-Order Setting - Lacey, Richardson, Smaill (2 citations) (Correct)
....speci cation. This part is then replaced by the appropriately instantiated 3 . or transformation . Logic Program Synthesis in a Higher Order Setting 20th January 11 second element of the schema. The majority of schema based synthesis systems are either mostly manually guided (for example [FD93] or apply schemas exhaustively (for example [VF96] In order to achieve automation, we can associate applicability heuristics to program synthesis schemas, which then become much like proof planning methods [FR99] Higher order program synthesis has not been covered by schema based approaches. ....
P. Flener and Y. Deville. Logic program synthesis from incomplete specications. Journal of Symbolic Computation: Special Issue on Automatic Programming, 1993.
Logic Program Synthesis via Proof Planning using Clam - Lacey (1999) (Correct)
....A folding problem is a speci cation of a logic program along with a description of the recursive calls of the program. Folding problems are then either solved directly or broken into subproblems by pre determined strategies. This produces a search space of strategies which is user guided. Flener Deville 93] uses a slightly di erent approach; that of program schemas. These are common patterns of logic programs. Flener Deville 93] uses open descriptions of relations to specify logic schemata. An open description of a relation is a logic program which calls other open relations which are unspeci ....
....problems are then either solved directly or broken into subproblems by pre determined strategies. This produces a search space of strategies which is user guided. Flener Deville 93] uses a slightly di erent approach; that of program schemas. These are common patterns of logic programs. Flener Deville 93] uses open descriptions of relations to specify logic schemata. An open description of a relation is a logic program which calls other open relations which are unspeci ed. A schema consists of an open description of a relation along with axioms that the open relations must satisfy. Synthesis ....
[Article contains additional citation context not shown here]
P. Flener and Y. Deville. Logic program synthesis from incomplete specications. Journal of Symbolic Computation: Special Issue on Automatic Programming, 1993.
Logic Program Synthesis in a Higher-Order Setting - Lacey, Richardson, Smaill (2000) (2 citations) (Correct)
....Synthesis proceeds recursively by nding a schema whose rst element matches part of the speci cation. This part is then replaced by the appropriately instantiated second element of the schema. The majority of schema based synthesis systems are either mostly manually guided (for example [6]) or apply schemas exhaustively (for example [21] In order to achieve automation, we can associate applicability heuristics to program synthesis schemas, which then become much like proof planning methods [7] Higher order program synthesis has not been covered by schema based approaches. 8] ....
P. Flener and Y. Deville. Logic program synthesis from incomplete specications. Journal of Symbolic Computation: Special Issue on Automatic Programming, 1993.
A New Heuristic to use Least Generalizations in ILP - Erdem, Flener Self-citation (Flener) (Correct)
....of recursive (logic) programs from incomplete speci cations. Indeed, every now and then, inductive synthesizers appear, having the basic synthesis algorithm of [8] given clausal evidence for a top level relation r. 9 Some synthesizers of this category are Thesys [20] BMWk [12, 16] Synapse [7, 5], Lopster [14] Cilp [15] Crustacean [1] MetaInduce [11] Dialogs [6, 8] etc. We here ignore the mechanics of Steps 1 and 2: there are various ways of achieving the results reported here (or similar ones) and we invite the reader to accept them as such, because our focus is on Step 3. Let us ....
P. Flener and Y. Deville. Logic program synthesis from incomplete specications. J. of Symbolic Computation 15(5-6):775-805, May/June 1993.
A New Declarative Bias for ILP: Construction Modes - Erdem, Flener Self-citation (Flener) (Correct)
....as a declarative (search) bias in any ILP system, in addition to any other biases already used there, because of the orthogonality and thus complementarity of our new bias. We have experimented with the usage of a simpler version of construction modes in two (related) ILP systems, namely synapse [5, 3] and dialogs [4] Both are schema guided ILP systems dedicated to the inference of recursive (logic) programs, and have grown out of the tradition pioneered (in functional programming) by the thesys system [16] and its generalization BMW k [8] The results of our experiments with synapse and ....
.... For instance, when the template is dc, then the role of q is usually played by compose (or decompose, by duality) For instance, consider the following evidence for delOdds: delOdds( delOdds( 1] delOdds( 2] 2] delOdds( 3; 4] 4] delOdds( 6; 7; 8] 6; 8] delOdds([5]; 5] E delOdds ) Suppose Step 1 creates the following open program, whose (only) open relation is compose: delOdds(X; Y ) minimal(X) solve(X; Y ) delOdds(X; Y ) minimal(X) decompose(X; H;T ) delOdds(T ; V ) compose(H; V; Y ) minimal(X) X = solve(X; Y ) Y = decompose(X; ....
[Article contains additional citation context not shown here]
P. Flener and Y. Deville. Logic program synthesis from incomplete specications. J. of Symbolic Computation 15(5-6):775-805, May/June 1993.
An Abstract Formulation of Correct Schemas for Program Synthesis - Flener, al. (1999) Self-citation (Flener) (Correct)
.... have been shown to be useful in a variety of applications, such as proving properties of programs (Manna, 1974) teaching programming to novices (Gegg Harrison, 1991) guiding manual synthesis (Barker Plummer, 1992; Dershowitz, 1983; Deville, 1990; Deville and Burnay, 1989) inductive synthesis (Flener and Deville, 1993; Flener, 1995; Flener, 1997; Hamfelt and Fischer Nilsson, 1997; Kodrato and Jouannaud, 1984; Sterling and Kirschenbaum, 1993; Summers, 1977) and deductive (semi )automatic synthesis (Blaine et al. 1998; Flener et al. 1997; Flener et al. 1998a; Flener et al. 1998b; Flener and Richardson, ....
P. Flener and Y. Deville (1993). Logic program synthesis from incomplete specications. J. Symbolic Computation 15(5-6), 775-805.
Towards Program Synthesis From A Small Example Set - Lubo Popelnsk Masaryk (1994) (1 citation) (Correct)
No context found.
Flener P. and Deville Y.: Logic program synthesis from incomplete specications. Journal of Symbolic Computation, 15(56):775805, May/June 1993.
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