Name
Abstract | ||
|---|---|---|
Given several input/output examples of some function we can state the problem: what is the simplest function which complies with these examples. This problem is well studied and is known to be very hard in the general case. In this paper we address a special case of the problem, when the target function can be expressed as a simple composition of known functions. We propose a new inductive synthesis algorithm for this case and show that it is efficient enough to synthesize complex geometry formulas. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/BFb0030390 | Nonmonotonic and Inductive Logic |
Keywords | Field | DocType |
rapid construction,towards efficient inductive synthesis,local regularities | Mathematical optimization,Computer science,Transport engineering,Complex geometry,Rapid construction,Special case | Conference |
ISBN | Citations | PageRank |
3-540-56433-0 | 1 | 0.41 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janis Barzdins | 1 | 199 | 35.69 |
| Guntis Barzdins | 2 | 121 | 18.62 |