(Enter summary)
Abstract: this paper. Some familiarity with logic programming
is assumed. (Update)
Context of citations to this paper: More
...improved this system into a new one called DIALOGS II. Thus, our aim became to improve DIALOGS, whose ancestor was the SYNAPSE system [11] [14], which induces recursive logic programs from a set of positive examples, and a set of Horn clauses that are called properties. The...
.... proposed by several authors (see, for instance, Deville and Burnay, 1989; Kirschenbaum et al. 1989; Fuchs and Fromherz, 1992; Flener and Deville, 1993; Marakakis and Gallagher, 1994 ] and some examples of logic program schema transformations can be found in [ Brough and...
Cited by: More
Schema-Guided Synthesis of Constraint Logic Programs - Kiziltan (1999)
(Correct)
Automated Verification Of Prolog Programs - Le Charlier, Leclere, Rossi.. (1994)
(Correct)
Specifications Are Necessarily Informal or: Some More Myths .. - Le Charlier, Flener (1998)
(Correct)
Active bibliography (related documents): More All
1.1: Towards Stepwise, Schema-Guided Synthesis of Logic Programs - Pierre Flener
(Correct)
1.1: Synthesis of Composition and Discrimination Operators for.. - Pierre Flener (1993)
(Correct)
1.0: On the Use of Inductive Reasoning in Program Synthesis.. - Flener, Popelínsky (1994)
(Correct)
Similar documents based on text: More All
0.3: Logic Program Schemas, Constraints and Semi-Unification - Chasseur, Deville (1998)
(Correct)
0.3: Logic Program Schemas, Semi-Unification and Constraints - Chasseur, Deville
(Correct)
0.2: Acceptance Driven Local Search and Evolutionary Algorithms - Eric Poupaert And
(Correct)
Related documents from co-citation: More All
12: Logic Program Synthesis from Incomplete Information (context) - FLENER - 1995
12: A methodology for lisp program construction from examples (context) - Summers - 1977
10: Inductive metalogic programming
- Hamfelt, Nilsson - 1994
BibTeX entry: (Update)
Pierre Flener and Yves Deville. Logic program synthesis from incomplete specifications. Journal of Symbolic Computation, Special Issue on Automatic Programming 15(5--6):775--805, May/June 1993. http://citeseer.comp.nus.edu.sg/12505.html More
@misc{ flener93logic,
author = "P. Flener and Y. Deville",
title = "Logic program synthesis from incomplete specifications",
text = "Pierre Flener and Yves Deville. Logic program synthesis from incomplete
specifications. Journal of Symbolic Computation, Special Issue on Automatic
Programming 15(5--6):775--805, May/June 1993.",
year = "1993",
url = "citeseer.comp.nus.edu.sg/12505.html" }
Citations (may not include all citations):
759
Negation-as-failure (context) - Clark - 1978
412
Language identification in the limit (context) - Gold - 1967
267
A note on inductive generalization (context) - Plotkin - 1970
166
Unification revisited (context) - Lassez, Maher et al. - 1987
133
Mathematical Theory of Computation (context) - Manna - 1974
89
Springer-Verlag (context) - Shapiro, ed et al. - 1986
79
Logic Programming: Systematic Program Development (context) - Deville - 1990
63
Transformational systems and the algebraic structure of atom.. (context) - Reynolds - 1970
61
Polynomial-time inference of arbitrary pattern languages (context) - Lange, Wiehagen - 1991
50
Derivation of logic programs (context) - Hogger - 1981
47
A methodology for LISP program construction from examples (context) - Summers - 1977
42
Algorithmic debugging with assertions
- Drabent, Nadjm-Tehrani et al. - 1988
41
The structure and design of global search algorithms (context) - Smith - 1988
30
The synthesis of logic programs from inductive proofs (context) - Bundy, Smaill et al. - 1990
30
Monotonic and non-monotonic inductive inference (context) - Jantke - 1991
19
Top-down synthesis of recursive logic procedures from firsto..
- Lau, Prestwich - 1990
17
Synthesis and transformation of logic programs in the Whelk .. (context) - Wiggins - 1992
16
Belief updating from integrity constraints and queries (context) - De Raedt, Bruynooghe - 1992
15
and Cybernetics (context) - Trans, Man - 1979
11
Dealing with search (context) - Biermann - 1984
10
Automatic Programming (context) - Biermann - 1992
10
Induction of Schemata for Program Synthesis (context) - Tinkham - 1990
8
Generalization and program schemata (context) - Deville, Burnay - 1989
8
Verification of Prolog programs using an extension of execut.. (context) - Kanamori, Seki - 1986
8
Basic Prolog schemata (context) - Gegg-Harrison - 1989
6
The synthesis and verification of logic programs (context) - Clark - 1981
5
A production rule mechanism for generating LISP code (context) - Biermann, Smith - 1979
4
Synthesis of composition and discrimination operators for di..
- Flener, Deville - 1993
4
Edinburgh University Press (context) - Meltzer, Michie et al. - 1970
3
A Formal Development of Programs (context) - Hansson - 1980
2
Algorithm Synthesis from Incomplete Specifications (context) - Flener - 1993
1
Meta-Programming in Logic Programming: Proc (context) - Abramson, Rogers et al. - 1988
1
Correctness criteria for logic program synthesis (context) - Deville, Flener - 1993
1
Towards stepwise (context) - Flener, Deville - 1992
1
Top-down synthesis of divide-and-conquer algorithms (context) - Synthesis, Specifications - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csd.uu.se/~pierref/research.html): More
Correctness Proofs of Transformation Schemas - Halime Buyukyildiz (1997)
(Correct)
Completing Open Logic Programs by Constructive Induction - Erdem, Flener
(Correct)
ILP and Automatic Programming: Towards Three Approaches - Flener.. (1994)
(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.