{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:03Z","timestamp":1725560163630},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221746"},{"type":"electronic","value":"9783540259381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25938-1_2","type":"book-chapter","created":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T12:45:52Z","timestamp":1280061952000},"page":"20-33","source":"Crossref","is-referenced-by-count":0,"title":["Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures"],"prefix":"10.1007","author":[{"given":"Francis","family":"Alexandre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Bsa\u00efes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moussa","family":"Demba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Bouverot, A.: Comparaison entre la transformation et l\u2019extraction de programmes logiques. PhD thesis, Universit\u00e9 Paris VII, en fran\u00e7ais (1991)"},{"key":"2_CR2","volume-title":"A Computational Logic","author":"R.S. Boyer","year":"1979","unstructured":"Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press, New York (1979)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0012826","volume-title":"9th International Conference on Automated Deduction","author":"A. Bundy","year":"1988","unstructured":"Bundy, A.: The use of explicit plans to guide inductive proofs. In: Lusk, E.\u2018., Overbeek, R. (eds.) CADE 1988. LNCS, vol.\u00a0310, pp. 111\u2013120. Springer, Heidelberg (1988)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bundy, A.: The Automation of Proof by Mathematical Induction. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, Elseviers Science Publishers B. V, North-Holland (2000)","DOI":"10.1016\/B978-044450813-3\/50015-1"},{"key":"2_CR5","first-page":"685","volume-title":"7th International Conference on Logic Programming","author":"L. Fribourg","year":"1990","unstructured":"Fribourg, L.: Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. In: Warren, D.H.D., Szeredi, P. (eds.) 7th International Conference on Logic Programming, Jerusalem, pp. 685\u2013699. MIT Press, Cambridge (1990)"},{"key":"2_CR6","unstructured":"Fr\u01cenov\u00e1, M., Kodratoff, Y.: Predicate synthesis from formal specifications. In: Neumann, B. (ed.) Proceedings of the 10th European Conference on Artificial Intelligence ECAI 1992, Chichester, England, pp. 87\u201391 (1992)"},{"key":"2_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-45744-5_41","volume-title":"Automated Reasoning","author":"J. Giesl","year":"2001","unstructured":"Giesl, J., Kapur, D.: Decidable classes of inductive theorems. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, p. 469. Springer, Heidelberg (2001)"},{"key":"2_CR8","first-page":"479","volume-title":"Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"W.A. Howard","year":"1980","unstructured":"Howard, W.A.: The formulae-as-types notion of construction. In: Sedlin, J.P., Hindley, J.R. (eds.) Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 479\u2013490. Academic Press, London (1980)"},{"key":"2_CR9","first-page":"235","volume-title":"Handbook of logic in Artificial Intelligence and Logic Programming","author":"A. Kakas","year":"1998","unstructured":"Kakas, A., Kowalski, R.A., Toni, F.: The Role of Abduction in Logic Programming. In: Handbook of logic in Artificial Intelligence and Logic Programming, vol.\u00a05, pp. 235\u2013324. Oxford University Press, Oxford (1998)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/3-540-16492-8_96","volume-title":"Third International Conference on Logic Programming","author":"T. Kanamori","year":"1986","unstructured":"Kanamori, T., Seki, H.: Verification of Prolog Programs Using an Extension of Execution. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 475\u2013489. Springer, Heidelberg (1986)"},{"key":"2_CR11","unstructured":"Kanamori, T.: Soundness and Completeness of Extended Execution for Proving Properties of Prolog Programs. Technical Report 175, ICOT (1986)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Monroy, R.: The use of Abduction and Recursion-Editor Techniques for the Correction of Faulty Conjectures. Automated Software Engineering, 91\u2013100 (2000)","DOI":"10.1109\/ASE.2000.873654"},{"key":"2_CR13","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/3-540-58216-9_29","volume-title":"Logic Programming and Automated Reasoning","author":"R. Monroy","year":"1994","unstructured":"Monroy, R., Bundy, A., Ireland, A.: Proof plan for the correction of false conjectures. In: Pfenning, F. (ed.) LPAR 1994. LNCS (LNAI), vol.\u00a0822, pp. 54\u201364. Springer, Heidelberg (1994)"},{"key":"2_CR14","unstructured":"Peirce, C.S.: Collected Papers of Charles Sanders Peirce. In: Harston, C., Weiss., P. (eds.) Harvard University Press, Cambridge (1959)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Pettorossi, A., Proietti, M.: Synthesis and transformation of logic programs using unfold\/fold proofs. Journal of Logic Programming, 197\u2013230 (1999)","DOI":"10.1016\/S0743-1066(99)00029-1"},{"key":"2_CR16","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-61511-3_70","volume-title":"Automated Deduction - Cade-13","author":"M. Protzen","year":"1996","unstructured":"Protzen, M.: Patching faulty conjectures. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS (LNAI), vol.\u00a01104, pp. 77\u201391. Springer, Heidelberg (1996)"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/(SICI)1096-9942(1998)4:1<27::AID-TAPO3>3.0.CO;2-4","volume":"4","author":"D. R\u00e9my","year":"1998","unstructured":"R\u00e9my, D., Vouillon, J.: Objective ML: An effective object oriented extension to ml. Theory and Practice of Object Systems\u00a04(1), 27\u201350 (1998)","journal-title":"Theory and Practice of Object Systems"},{"key":"2_CR18","series-title":"LNAI","volume-title":"Logic Programming \u201988","author":"A. Sakurai","year":"1989","unstructured":"Sakurai, A., Motoda, H.: Proving Definite Clauses without Explicit Use of Inductions. In: Fujisaki, T., Furukawa, K., Tanaka, H. (eds.) Logic Programming 1988. LNCS (LNAI), vol.\u00a0383, Springer, Heidelberg (1989)"},{"key":"2_CR19","unstructured":"Tamaki, H., Sato, T.: Unfold\/Fold Transformation of Logic Programs. In: Proceedings of the 2nd International Logic Programming Conference, Uppsala (1984)"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25938-1_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:56Z","timestamp":1605761936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25938-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221746","9783540259381"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25938-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}