{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:58:20Z","timestamp":1760061500297},"reference-count":116,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7019,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0743-1066(94)90029-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"321-350","source":"Crossref","is-referenced-by-count":42,"special_numbering":"S1","title":["Logic program synthesis"],"prefix":"10.1016","volume":"19-20","author":[{"given":"Yves","family":"Deville","sequence":"first","affiliation":[]},{"given":"Kung-Kiu","family":"Lau","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(94)90029-9_BIB1","series-title":"Foundations of Deductive Databases","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0743-1066(94)90029-9_BIB2","series-title":"Colloquia Mathematica Societatis Janos Bolyai 26, Mathematical Logic in Computer Science","first-page":"111","article-title":"On an Interactive Program Verifier for Prolog Programs","author":"Balogh","year":"1978"},{"issue":"11","key":"10.1016\/0743-1066(94)90029-9_BIB3","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1109\/TSE.1985.231877","article-title":"A 15 Year Perspective on Automatic Programming","volume":"11","author":"Balzer","year":"1985","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"10.1016\/0743-1066(94)90029-9_BIB4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/2363.2528","article-title":"Proofs as Programs","volume":"7","author":"Bates","year":"1985","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/0743-1066(94)90029-9_BIB5","series-title":"Proceedings of TAPSOFT '89, LNCS 352","first-page":"96","article-title":"Verifying Correctness of Logic Programs","author":"Bossi","year":"1989"},{"issue":"2","key":"10.1016\/0743-1066(94)90029-9_BIB6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/78942.78947","article-title":"A Method for Specializing Logic Program","volume":"12","author":"Bossi","year":"1990","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/0743-1066(94)90029-9_BIB7","series-title":"The Handbook of Artificial Intelligence","year":"1982"},{"key":"10.1016\/0743-1066(94)90029-9_BIB8","series-title":"Automatic Program Construction Techniques","year":"1984"},{"key":"10.1016\/0743-1066(94)90029-9_BIB9","series-title":"Automatic Program Construction Techniques","first-page":"69","article-title":"LOPS\u2014a System Based on a Strategical Approach to Program Synthesis","author":"Bibel","year":"1984"},{"key":"10.1016\/0743-1066(94)90029-9_BIB10","series-title":"Encyclopedia of Artificial Intelligence","first-page":"59","article-title":"Automatic Programming","author":"Biermann","year":"1992"},{"key":"10.1016\/0743-1066(94)90029-9_BIB11","author":"Biermann","year":"1993","journal-title":"Personal Communication"},{"key":"10.1016\/0743-1066(94)90029-9_BIB12","first-page":"47","article-title":"Clich\u00e9 Programming in Prolog","author":"Barker-Plummer","year":"1990","journal-title":"Proceedings of Meta'90"},{"key":"10.1016\/0743-1066(94)90029-9_BIB13","series-title":"PROLOG Programming for Artificial Intelligence","author":"Bratko","year":"1986"},{"key":"10.1016\/0743-1066(94)90029-9_BIB14","first-page":"221","article-title":"Turning Eureka Steps into Calculations in Automatic Program Synthesis","author":"Bundy","year":"1990","journal-title":"Proceedings of UKIT 90"},{"issue":"1\u20132","key":"10.1016\/0743-1066(94)90029-9_BIB15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0743-1066(89)90033-2","article-title":"Compiling Control","volume":"6","author":"Bruynooghe","year":"1989","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)90029-9_BIB16","article-title":"Rippling: A Heuristic for Guiding Inductive Proofs","author":"Bundy","year":"1991","journal-title":"Research Paper 567"},{"key":"10.1016\/0743-1066(94)90029-9_BIB17","series-title":"Proceedings of Esprit Symposium on Computational Logic","first-page":"135","article-title":"The Synthesis of Logic Programs from Inductive Proofs","author":"Bundy","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","article-title":"Proving Properties of Programs by Structural Induction","volume":"72","author":"Burstall","year":"1969","journal-title":"The Computer Journal"},{"key":"10.1016\/0743-1066(94)90029-9_BIB19","series-title":"IFIP 74","first-page":"308","article-title":"Program Proving as Hand Simulation with a Little Induction","author":"Burstall","year":"1974"},{"key":"10.1016\/0743-1066(94)90029-9_BIB20","series-title":"Proceedings of the 10th International Conference on Automated Deduction","first-page":"647","article-title":"The Oyster-Clam System","author":"Bundy","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB21","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00249016","article-title":"Experiments with Proofs Plans for Induction","volume":"7","author":"Bundy","year":"1991","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/0743-1066(94)90029-9_BIB22","series-title":"Proceedings of the 10th International Conference on Automated Deduction","first-page":"132","article-title":"Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs","author":"Bundy","year":"1990"},{"issue":"1","key":"10.1016\/0743-1066(94)90029-9_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(88)90002-8","article-title":"Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming","volume":"78","author":"Courcelle","year":"1988","journal-title":"Information and Computation"},{"key":"10.1016\/0743-1066(94)90029-9_BIB24","series-title":"Implementing Mathematics with the NuPRL Proof Development System","author":"Constable","year":"1986"},{"key":"10.1016\/0743-1066(94)90029-9_BIB25","series-title":"Technical Report 79\/59","article-title":"Predicate Logic as a Computational Formalism","author":"Clark","year":"1979"},{"key":"10.1016\/0743-1066(94)90029-9_BIB26","series-title":"Technical Report DOC 81\/36","article-title":"The Synthesis and Verification of Logic Programs","author":"Clark","year":"1981"},{"key":"10.1016\/0743-1066(94)90029-9_BIB27","series-title":"Programming in Prolog","author":"Clocksin","year":"1984"},{"key":"10.1016\/0743-1066(94)90029-9_BIB28","series-title":"Proceedings of ICLP'91","first-page":"629","article-title":"Proving Correctness of Logic Programs Using Axiomatic Semantics","author":"Colussi","year":"1991"},{"key":"10.1016\/0743-1066(94)90029-9_BIB29","first-page":"419","article-title":"Predicate Logic: A Calculus for Deriving Programs","author":"Clark","year":"1977","journal-title":"Proceedings of IJCAI-77"},{"key":"10.1016\/0743-1066(94)90029-9_BIB30","series-title":"Proceedings of IFIP 77","first-page":"939","article-title":"A First Order Theory of Data and Programs","author":"Clark","year":"1977"},{"key":"10.1016\/0743-1066(94)90029-9_BIB31","first-page":"9","article-title":"Logic Program Derivation for a Class of First Order Logic Relations","author":"Dayantis","year":"1987","journal-title":"Proceedings of IJCAI-87"},{"key":"10.1016\/0743-1066(94)90029-9_BIB32","series-title":"Proceedings of North American Conference on Logic Programming 1989","first-page":"409","article-title":"Generalization and Program Schemata: A Step Towards Computer-Aided Construction of Logic Programs","author":"Deville","year":"1989"},{"key":"10.1016\/0743-1066(94)90029-9_BIB33","series-title":"International Series in Logic Programming","article-title":"Logic Programming: Systematic Program Development","author":"Deville","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB34","first-page":"133","article-title":"Logic Programming: Methodology and Teaching","author":"Deransart","year":"1988","journal-title":"Proceedings of the French Japan Symposium"},{"key":"10.1016\/0743-1066(94)90029-9_BIB35","series-title":"Technical Report RR 1011","article-title":"A Methodological View of Logic Programming with Negation","author":"Deransart","year":"1989"},{"key":"10.1016\/0743-1066(94)90029-9_BIB36","series-title":"Proceedings of TAPSOFT '87, 2, LNCS 250","first-page":"167","article-title":"Inductive Assertion Method for Logic Programs","author":"Drabent","year":"1987"},{"key":"10.1016\/0743-1066(94)90029-9_BIB37","series-title":"Proceedings of JICSLP'92","first-page":"161","article-title":"Proof Methods of Partial Correctness and Weak Completeness for Normal Logic Programs","author":"Ferrand","year":"1992"},{"key":"10.1016\/0743-1066(94)90029-9_BIB38","series-title":"Logic Program Synthesis and Transformation","first-page":"46","article-title":"Towards Stepwise, Schema-Guided Synthesis of Logic Programs","author":"Flener","year":"1992"},{"key":"10.1016\/0743-1066(94)90029-9_BIB39","series-title":"Constructing Logic Programs","article-title":"Synthesis of Composition and Discriminate Operators for Divide-and-Conquer Logic Programs","author":"Flener","year":"1993"},{"key":"10.1016\/0743-1066(94)90029-9_BIB40","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(06)80012-X","article-title":"Logic Program Synthesis from Incomplete Specifications","author":"Flener","year":"1993","journal-title":"Journal of Symbolic Computation: Special Issue on Automatic Programming"},{"key":"10.1016\/0743-1066(94)90029-9_BIB41","series-title":"Ph.D. thesis","article-title":"Logic Algorithm Synthesis from Examples and Properties","author":"Flener","year":"1993"},{"key":"10.1016\/0743-1066(94)90029-9_BIB42","series-title":"Proceedings of 7th Int. Conference on Logic Programming","first-page":"685","article-title":"Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction","author":"Fribourg","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB43","series-title":"Proceedings of 1991 International Logic Programming Symposium","first-page":"103","article-title":"Automatic Generation of Simplification Lemmas for Inductive Proofs","author":"Fribourg","year":"1991"},{"key":"10.1016\/0743-1066(94)90029-9_BIB44","series-title":"Constructing Logic Programs","article-title":"Extracting Logic Programs that Use Extended Prolog Execution and Induction","author":"Fribourg","year":"1993"},{"key":"10.1016\/0743-1066(94)90029-9_BIB45","series-title":"Technical Report CS-1989-20","article-title":"Basic Prolog Schemata","author":"Gegg-Harrison","year":"1989"},{"key":"10.1016\/0743-1066(94)90029-9_BIB46","series-title":"Technical Report CS-1990-4","article-title":"A Scheme-Based Approach to Teaching Recursive Prolog Programming","author":"Gegg-Harrison","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB47","series-title":"Prolog","author":"Giannesini","year":"1986"},{"key":"10.1016\/0743-1066(94)90029-9_BIB48","series-title":"Proceedings of 1988 International Logic Programming Symposium","first-page":"1070","article-title":"The Stable Model Semantics for Logic Programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/0743-1066(94)90029-9_BIB49","series-title":"Proceedings of JICSLP'92","first-page":"131","article-title":"Observational Equivalences for Logic Programs","author":"Gabrielli","year":"1992"},{"issue":"7","key":"10.1016\/0743-1066(94)90029-9_BIB50","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1109\/TSE.1986.6312977","article-title":"Knowledge-Based Programming: A Survey of Program Design and Construction Techniques","volume":"12","author":"Goldberg","year":"1986","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/0743-1066(94)90029-9_BIB51","series-title":"Proceedings of CADE'90","first-page":"588","article-title":"Programming by Example and Proving by Example Using Higher-Order Unification","author":"Hagiya","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB52","series-title":"Ph.D. thesis","article-title":"A Formal Development of Programs","author":"Hansson","year":"1980"},{"key":"10.1016\/0743-1066(94)90029-9_BIB53","series-title":"3rd Working Conference on the Formal Description of Programming Concepts","article-title":"A System Extracting Programs from Proofs","author":"Hayashi","year":"1986"},{"key":"10.1016\/0743-1066(94)90029-9_BIB54","series-title":"Proceedings of PLILP'92","first-page":"217","article-title":"Folon: An Environment for Declarative Construction of Logic Programs","author":"Henrard","year":"1992"},{"key":"10.1016\/0743-1066(94)90029-9_BIB55","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00264598","article-title":"Proving and Applying Program Transformations Expressed with Second-Order Patterns","volume":"11","author":"Huet","year":"1978","journal-title":"Acta Informatica"},{"key":"10.1016\/0743-1066(94)90029-9_BIB56","series-title":"Technical Report TR-91-02","article-title":"The G\u00f6del Report","author":"Hill","year":"1991"},{"key":"10.1016\/0743-1066(94)90029-9_BIB57","series-title":"Proceedings of AISB\/GI Conference on Artificial Intelligence","first-page":"22","article-title":"Program Synthesis in Predicate Logic","author":"Hogger","year":"1978"},{"issue":"2","key":"10.1016\/0743-1066(94)90029-9_BIB58","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/322248.322258","article-title":"Derivation of Logic Programs","volume":"28","author":"Hogger","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(94)90029-9_BIB59","series-title":"Introduction to Logic Programming","author":"Hogger","year":"1984"},{"key":"10.1016\/0743-1066(94)90029-9_BIB60","series-title":"To H.B. Curry; Essays on Combinatory Logic, Lamda Calculus and Formalism","first-page":"479","article-title":"The Formulae-as-Type Notion of Construction","author":"Howard","year":"1980"},{"key":"10.1016\/0743-1066(94)90029-9_BIB61","first-page":"348","article-title":"A Natural Programming Calculus","author":"Hansson","year":"1979","journal-title":"Proceedings of IJCAI-79"},{"key":"10.1016\/0743-1066(94)90029-9_BIB62","series-title":"Technical Report TR-175","article-title":"Soundness and Completeness of Extended Execution for Proving Properties of Prolog Programs","author":"Kanamori","year":"1986"},{"key":"10.1016\/0743-1066(94)90029-9_BIB63","series-title":"Proceedings of 1991 Int. Logic Programming Symposium","first-page":"611","article-title":"Derivation of Efficient Logic Programs by Synthesizing New Predicates","author":"Kawamura","year":"1991"},{"key":"10.1016\/0743-1066(94)90029-9_BIB64","series-title":"Proceedings of Fifth Generation Computer Systems 92","first-page":"463","article-title":"Logic Program Synthesis from First Order Logic Specifications","author":"Kawamura","year":"1992"},{"key":"10.1016\/0743-1066(94)90029-9_BIB65","series-title":"Logic Program Synthesis and Transformation","first-page":"1","article-title":"Logic Program Synthesis via Proof Planning","author":"Kraan","year":"1993"},{"key":"10.1016\/0743-1066(94)90029-9_BIB66","series-title":"Proceedings of 10th International Conference on Logic Programming","first-page":"441","article-title":"Middle-Out Reasoning for Logic Program Synthesis","author":"Kraan","year":"1993"},{"key":"10.1016\/0743-1066(94)90029-9_BIB67","first-page":"281","article-title":"Formulation of Induction Formulas in Verification of Prolog Programs","volume":"LNCS 225","author":"Kanamori","year":"1986"},{"key":"10.1016\/0743-1066(94)90029-9_BIB68","first-page":"744","article-title":"Construction of Logic Programs Based on Generalized Unfold\/Fold Rules","author":"Kanamori","year":"1987","journal-title":"Proceedings of 4th International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(94)90029-9_BIB69","series-title":"Technical Report TR-403","article-title":"Preservation of Stronger Equivalence in Unfold\/Fold Logic Program Transformation (ii)","author":"Kanamori","year":"1988"},{"issue":"3","key":"10.1016\/0743-1066(94)90029-9_BIB70","first-page":"53","article-title":"Towards a Formal Theory of Program Construction","volume":"4","author":"Kreitz","year":"1990","journal-title":"Revue d'Intelligence Artificielle"},{"key":"10.1016\/0743-1066(94)90029-9_BIB71","series-title":"Formal Mathematics for Verifiably Correct Program Synthesis","author":"Kreitz","year":"1993"},{"key":"10.1016\/0743-1066(94)90029-9_BIB72","author":"Kreitz","year":"1993","journal-title":"Meta-synthesis\u2014Deriving Programs that Develop Programs"},{"key":"10.1016\/0743-1066(94)90029-9_BIB73","series-title":"Proceedings of 3rd International Conference on Logic Programming","first-page":"475","article-title":"Verification of Prolog Programs Using an Extension of Execution","author":"Kanamori","year":"1986"},{"key":"10.1016\/0743-1066(94)90029-9_BIB74","series-title":"Technical Report TR-90-109","article-title":"Prolog Programming Using Skeletons and Techniques","author":"Kirschenbaum","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB75","first-page":"757","article-title":"Refinement Strategies for Inductive Learning of Simple Prolog Programs","author":"Kirschenbaum","year":"1991","journal-title":"Proceedings of IJCAI'91"},{"key":"10.1016\/0743-1066(94)90029-9_BIB76","series-title":"Ph.D. thesis","article-title":"A Workshop for Developing Logic Programs by Stepwise Enhancement","author":"Lakhotia","year":"1989"},{"key":"10.1016\/0743-1066(94)90029-9_BIB77","series-title":"Proceedings of NACLP'89","first-page":"426","article-title":"Incorporating \u201cProgramming Techniques\u201d into Prolog Programs","author":"Lakhotia","year":"1989"},{"key":"10.1016\/0743-1066(94)90029-9_BIB78","series-title":"Ph.D. Thesis","article-title":"Combining Induction with Resolution in Logic Programming","author":"Lever","year":"1991"},{"key":"10.1016\/0743-1066(94)90029-9_BIB79","series-title":"Proceedings of ICLP'91","first-page":"614","article-title":"Proving Program Properties by Means of SLS-Resolution","author":"Lever","year":"1991"},{"key":"10.1016\/0743-1066(94)90029-9_BIB80","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(94)90029-9_BIB81","series-title":"Technical Report UMCS-92-11-2","article-title":"Towards a Formal Framework for Deductive Synthesis of Logic Programs","author":"Lau","year":"1992"},{"key":"10.1016\/0743-1066(94)90029-9_BIB82","series-title":"Proceedings of 10th International Conference on Logic Programming","first-page":"456","article-title":"An Incompleteness Result for Deductive Synthesis of Logic Programs","author":"Lau","year":"1993"},{"key":"10.1016\/0743-1066(94)90029-9_BIB83","series-title":"Logic Program Synthesis and Transformation","article-title":"A Formal View of Specification, Deductive Synthesis and Transformation of Logic Programs","author":"Lau","year":"1994"},{"key":"10.1016\/0743-1066(94)90029-9_BIB84","series-title":"Proceedings of 7th International Conference on Logic Programming","first-page":"667","article-title":"Top-Down Synthesis of Recursive Logic Procedures from First-Order Logic Specifications","author":"Lau","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB85","series-title":"Proceedings of 1991 International Logic Programming Symposium","first-page":"641","article-title":"Synthesis of a Family of Recursive Sorting Procedures","author":"Lau","year":"1991"},{"key":"10.1016\/0743-1066(94)90029-9_BIB86","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF03037138","article-title":"Composing Recursive Logic Programs with Clausal Join","volume":"6","author":"Lakhotia","year":"1988","journal-title":"New Generation Computing"},{"key":"10.1016\/0743-1066(94)90029-9_BIB87","article-title":"Stepwise Enhencement: A Variant of Incremental Programming","author":"Lakhotia","year":"1990","journal-title":"Proceedings of Conference on Software Engineering"},{"key":"10.1016\/0743-1066(94)90029-9_BIB88","article-title":"Guiding Synthesis Proofs","author":"Lombart","year":"1993","journal-title":"LOPSTR'93"},{"key":"10.1016\/0743-1066(94)90029-9_BIB89","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"627","article-title":"Equivalences of Logic Programs","author":"Maher","year":"1988"},{"key":"10.1016\/0743-1066(94)90029-9_BIB90","article-title":"Inductive Logic Programming: A Survey","author":"Muggleton","year":"1993","journal-title":"Journal of Logic Programming, Special Issue on \u201cTen Years of Logic Programming\u201d"},{"issue":"4","key":"10.1016\/0743-1066(94)90029-9_BIB91","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF03037089","article-title":"Inductive Logic Programming","volume":"8","author":"Muggleton","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/0743-1066(94)90029-9_BIB92","volume":"Volume APIC-38","year":"1992"},{"issue":"1","key":"10.1016\/0743-1066(94)90029-9_BIB93","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/357084.357090","article-title":"A Deductive Approach to Program Synthesis","volume":"2","author":"Manna","year":"1980","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/0743-1066(94)90029-9_BIB94","series-title":"Proceedings of FST & TCS","article-title":"Specification = Program + Types","author":"Naish","year":"1987"},{"key":"10.1016\/0743-1066(94)90029-9_BIB95","series-title":"Constructing Logic Programs","article-title":"Verification of Logic Programs and Imperative Programs","author":"Naish","year":"1993"},{"key":"10.1016\/0743-1066(94)90029-9_BIB96","article-title":"The IO-Graph Method: Algorithm Design and Implementation","author":"Neugebauer","year":"1992","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/0743-1066(94)90029-9_BIB97","series-title":"Logic Program Synthesis and Transformation","first-page":"80","article-title":"The LOPS Approach: A Transformation Point of View","author":"Neugebauer","year":"1993"},{"key":"10.1016\/0743-1066(94)90029-9_BIB98","series-title":"Logic Programming Series","article-title":"The Craft of Prolog","author":"O'Keefe","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB99","series-title":"Machine Intelligence 5","first-page":"153","article-title":"A Note on Inductive Generalization","author":"Plotkin","year":"1970"},{"key":"10.1016\/0743-1066(94)90029-9_BIB100","series-title":"Machine Intelligence 6","first-page":"101","article-title":"A Further Note on Inductive Generalization","author":"Plotkin","year":"1971"},{"key":"10.1016\/0743-1066(94)90029-9_BIB101","series-title":"Proceedings of 1988 International Logic Programming Symposium","first-page":"1081","article-title":"Perfect Model Semantics","author":"Przymunsinski","year":"1988"},{"key":"10.1016\/0743-1066(94)90029-9_BIB102","series-title":"Proceedings of 7th International Conference on Logic Programming","first-page":"390","article-title":"A Notion of Map Between Logic Programs","author":"Power","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB103","series-title":"Machine Intelligence 5","first-page":"135","article-title":"Transformational Systems and the Algebraic Structure of Atomic Formulas","author":"Reynolds","year":"1970"},{"issue":"8","key":"10.1016\/0743-1066(94)90029-9_BIB104","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/2.75","article-title":"Automatic Programming: Myths and Prospects","volume":"21","author":"Rich","year":"1988","journal-title":"IEEE Computer"},{"key":"10.1016\/0743-1066(94)90029-9_BIB105","first-page":"446","article-title":"An Algorithm that Infers Theories from Facts","author":"Shapiro","year":"1981","journal-title":"Proceedings of IJCAI'81"},{"key":"10.1016\/0743-1066(94)90029-9_BIB106","series-title":"Algorithmic Program Debugging","author":"Shapiro","year":"1983"},{"key":"10.1016\/0743-1066(94)90029-9_BIB107","series-title":"Automatic Program Construction Techniques","first-page":"307","article-title":"The Synthesis of LISP Programs from Examples","author":"Smith","year":"1984"},{"key":"10.1016\/0743-1066(94)90029-9_BIB108","series-title":"Technical Report KES.U.87.12","article-title":"The Structure and Design of Global Search Algorithms","author":"Smith","year":"1988"},{"issue":"9","key":"10.1016\/0743-1066(94)90029-9_BIB109","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1109\/32.58788","article-title":"KIDS: A Semiautomatic Program Development System","volume":"16","author":"Smith","year":"1990","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/0743-1066(94)90029-9_BIB110","series-title":"The Art of Prolog","author":"Sterling","year":"1986"},{"key":"10.1016\/0743-1066(94)90029-9_BIB111","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/S0747-7171(89)80064-1","article-title":"First Order Compiler: A Deterministic Logic Program Synthesis Algorithm","volume":"8","author":"Sato","year":"1989","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/0743-1066(94)90029-9_BIB112","series-title":"Ph.D. thesis","article-title":"Induction of Schemata for Program Synthesis","author":"Tinkham","year":"1990"},{"key":"10.1016\/0743-1066(94)90029-9_BIB113","first-page":"221","article-title":"Unfounded Sets and Well-Founded Semantics for General Logic Programs","author":"Van Gelder","year":"1988","journal-title":"Proceedings of 7th Symposium on Principles of Database Systems"},{"key":"10.1016\/0743-1066(94)90029-9_BIB114","series-title":"Logic Program Synthesis and Transformation","first-page":"27","article-title":"Synthesis and Transformation of Logic Programs from Constructive, Inductive Proof","author":"Wiggins","year":"1992"},{"key":"10.1016\/0743-1066(94)90029-9_BIB115","series-title":"Proceedings of META-92","article-title":"Negation and Control in Automatically Generated Logic Programs","author":"Wiggins","year":"1992"},{"key":"10.1016\/0743-1066(94)90029-9_BIB116","series-title":"Proceedings of JICSLP'92","first-page":"351","article-title":"Synthesis and Transformation of Logic Programs in the Whelk Proof Development System","author":"Wiggins","year":"1992"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:20:34Z","timestamp":1555064434000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106694900299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":116,"alternative-id":["0743106694900299"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)90029-9","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}