PIERRE FLENER, YVES DEVILLE This chapter gives a brief overview of our...  @ NUS Home/Search
Context Related
| csd.uu.se/~pierref/pub...Jacquet93.ps.z dis.uu.se/~pierref/pu...Jacquet93.ps.gz Cached: PS.gz PS PDF Image Update Help From: csd.uu.se/~pierref/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper. Step 8 is straightforward again, but is also covered here. The development of all these steps can be found in [Fle93]. Note that the divide-and-conquer schema is not an input to the synthesis mechanism, but rather hardwired into it. 12/8/1993 16:42---PAGE PROOFS for John Wiley & Sons Ltd (using jwcbmc02, Vers 31.08 AUGUST 1992)---root SAMPLE PROBLEMS 5 We implement deterministic and non-deterministic relations using the same synthesis mechanism. The choice of an induction... (Update)
Context of citations to this paper: More
...Finally, in Section 9, we draw some conclusions on the results presented here. This paper extends results presented by Flener and Deville (1992, 1993). A full development of this paper can be found in (Flener, 1993) 2. Correctness of Logic Algorithms It is important to...
.... systems is based on programming abstractions like program schemata, skeletons, logic program forms, clich es [5] 20] 21] 25] [26], 30] 31] 40] 52] 53] 73] 74] 80] 86] 90] 97] 1.2 Motivation for a New Method for Developing Logic Programs 1.2.1...
Cited by: More
Predicate Invention in Inductive Program Synthesis - Flener (1995) (Correct)
Logic Program Development Based on Typed, Moded Schemata and.. - Marakakis (1997) (Correct)
Logic Program Schemata: Synthesis and Analysis - Flener (1995) (Correct)
Active bibliography (related documents): More All
1.6: Towards Stepwise, Schema-Guided Synthesis of Logic Programs - Pierre Flener (Correct)
1.1: Logic Program Synthesis from Incomplete Specifications - Flener, Deville (1993) (Correct)
0.6: On the Use of Inductive Reasoning in Program Synthesis.. - Flener, Popelínsky (1994) (Correct)
Similar documents based on text: More All
0.1: An Abstract Formulation of Correct Schemas for Program Synthesis - Flener, al. (1999) (Correct)
0.1: Logic Program Schemas, Constraints and Semi-Unification - Chasseur, Deville (1998) (Correct)
0.0: Logic Program Schemas, Semi-Unification and Constraints - Chasseur, Deville (Correct)
Related documents from co-citation: More All
4: Logic Programming: Systematic Program Development (context) - Deville - 1990
3: A methodology for lisp program construction from examples (context) - Summers - 1977
3: Induction of Schemata for Program Synthesis (context) - Tinkham - 1990
BibTeX entry: (Update)
Flener, P., Deville, Y. (1993). Synthesis of composition and discrimination operators for divideand -conquer logic programs. In: Jacquet, J.-M. (ed) Constructing Logic Programs, John Wiley & Sons, 1993. http://citeseer.comp.nus.edu.sg/131091.html More
@misc{ flener93synthesis,
author = "P. Flener and Y. Deville",
title = "Synthesis of composition and discrimination operators for divideand -conquer
logic programs",
text = "Flener, P., Deville, Y. (1993). Synthesis of composition and discrimination
operators for divideand -conquer logic programs. In: Jacquet, J.-M. (ed)
Constructing Logic Programs, John Wiley & Sons, 1993.",
year = "1993",
url = "citeseer.comp.nus.edu.sg/131091.html" }
Citations (may not include all citations):388 Inductive Logic Programming - Muggleton - 1992
267 A Note on Inductive Generalization (context) - Plotkin - 1970
133 Mathematical Theory of Computation (context) - Manna - 1974
79 Logic Programming: Systematic Program Development (context) - Deville - 1990
50 Derivation of Logic Programs (context) - Hogger - 1981
47 A Methodology for LISP Program Construction from Examples (context) - Summers - 1977
42 Top-down Synthesis of Divide-and-Conquer Algorithms (context) - Smith - 1985
41 The Structure and Design of Global Search Algorithms (context) - Smith - 1988
26 Logic Program Synthesis from Incomplete Specifications - Flener, Deville - 1993
23 Extracting Logic Programs from Proofs that Use Extended Prol.. (context) - Fribourg - 1990
19 Top-Down Synthesis of Recursive Logic Procedures from First-.. - Lau, Prestwich - 1990
15 IEEE Transactions on Software Engineering (context) - Manna, Waldinger et al. - 1979
14 Generalization and Program Schemata: A Step Towards Computer.. (context) - Deville, Burnay - 1989
11 Schema-Guided Synthesis of Logic Programs (context) - Flener, Deville - 1991
11 Dealing with Search (context) - Biermann - 1984
10 Automatic Programming (context) - Biermann - 1992
8 Basic Prolog Schemata (context) - Gegg-Harrison - 1989
6 The ACM Distinguished Dissertation Series (context) - Shapiro, Debugging - 1982
5 Department of Computer Science (context) - Hansson, Development et al. - 1980
5 A Production Rule Mechanism for Generating LISP Code (context) - Biermann, Smith - 1979
2 Algorithm Synthesis from Incomplete Specifications (context) - Flener - 1993
2 Towards Programming by Examples and Properties (context) - Flener - 1991
2 Research Report DOC (context) - Clark, Verification et al. - 1981
Documents on the same site (http://www.csd.uu.se/~pierref/research.html): More
Correctness Proofs of Transformation Schemas - Halime Buyukyildiz (1997) (Correct)
Logic Program Synthesis from Incomplete Specifications - Flener, Deville (1993) (Correct)
Completing Open Logic Programs by Constructive Induction - Erdem, Flener (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.