{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:06Z","timestamp":1725664986549},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627180"},{"type":"electronic","value":"9783540684947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62718-9_17","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:49:29Z","timestamp":1330296569000},"page":"295-312","source":"Crossref","is-referenced-by-count":4,"title":["Forms of logic specifications: A preliminary study"],"prefix":"10.1007","author":[{"given":"Kung-Kiu","family":"Lau","sequence":"first","affiliation":[]},{"given":"Mario","family":"Ornaghi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/2363.2528","volume":"7","author":"J.L. Bates","year":"1985","unstructured":"J.L. Bates and R.L. Constable. Proofs as programs. ACM TOPLAS 7(1):113\u2013136, 1985.","journal-title":"ACM TOPLAS"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"A. Bundy, A. Smaill and G. Wiggins. The synthesis of logic programs from inductive proofs. In J.W. Lloyd, editor, Proc. Esprit Symposium on Computational Logic, pages 135\u2013149, Springer-Verlag, 1990.","DOI":"10.1007\/978-3-642-76274-1_8"},{"key":"17_CR3","unstructured":"C.C. Chang and H.J. Keisler. Model Theory. North-Holland, 1973."},{"key":"17_CR4","unstructured":"K.L. Clark. Predicate Logic as a Computational Formalism. Tech. Rep. 79\/59, Imperial College, 1979."},{"key":"17_CR5","unstructured":"K.L. Clark. The Synthesis and Verification of Logic Programs. Tech. Rep. 81\/36, Imperial College, 1981."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0743-1066(94)90029-9","volume":"19","author":"Y. Deville","year":"1994","unstructured":"Y. Deville and K.K. Lau. Logic program synthesis. J. Logic Programming 19, 20:321\u2013350, 1994. Special issue: Ten years of logic programming.","journal-title":"J. Logic Programming"},{"key":"17_CR7","unstructured":"L. Fribourg. Extracting logic programs from proofs that use extended Prolog execution and induction. In D.H.D. Warren and P. Szeredi, editors, Proc. 7 th Int. Conf. on Logic Programming, pages 685\u2013699, MIT Press, 1990."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"J. Goguen and J. Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In B. Shriver and P. Wegner, editors, Research Directions in Object-Oriented Programming, pages 417\u2013477, MIT Press, 1987.","DOI":"10.1145\/323779.323755"},{"key":"17_CR9","first-page":"348","volume":"79","author":"\u00c5. Hansson","year":"1979","unstructured":"\u00c5. Hansson and S.-\u00c5. T\u00e4rnlund. A natural programming calculus. In Proc. IJCAI 79, pages 348\u2013355, 1979.","journal-title":"Proc. IJCAI"},{"key":"17_CR10","unstructured":"P.M. Hill and J.W. Lloyd. The G\u00f6del Programming Language. MIT Press, 1994."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"W. Hodges. Logical features of Horn clauses. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol 1, pages 449\u2013503, Oxford University Press, 1993.","DOI":"10.1093\/oso\/9780198537458.003.0007"},{"issue":"2","key":"17_CR12","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/322248.322258","volume":"28","author":"C.J. Hogger","year":"1981","unstructured":"C.J. Hogger. Derivation of logic programs. J. ACM, 28(2):372\u2013392, April 1981.","journal-title":"J. ACM"},{"key":"17_CR13","unstructured":"C.J. Hogger. Introduction to Logic Programming. Academic Press, 1984."},{"key":"17_CR14","unstructured":"C.B. Jones. Systematic Software Development Using VDM. Prentice Hall, 2nd edition, 1990."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"T. Kanamori and H. Seki. Verification of Prolog programs using an extension of execution. In E. Shapiro, editor, Proc. 3 rd Int. Conf. on Logic Programming, Lecture Notes in Computer Science 225, pages 475\u2013489, 1986.","DOI":"10.1007\/3-540-16492-8_96"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"K.K. Lau and M. Ornaghi. On specification frameworks and deductive synthesis of logic programs. In L. Fribourg and F. Turini, editors, Proc. LOPSTR 94 and META 94, Lecture Notes in Computer Science 883, pages 104\u2013121, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58792-6_7"},{"key":"17_CR17","unstructured":"K.K. Lau, M. Ornaghi and S.-\u00c5. T\u00e4rnlund. The halting problem for deductive synthesis of logic programs. In P. van Hentenryck, editor, Proc. 11 th Int. Conf. on Logic Programming, pages 665\u2013683, MIT Press, 1994."},{"key":"17_CR18","unstructured":"K.K. Lau and M. Ornaghi. A formal approach to deductive synthesis of constraint logic programs. In J.W. Lloyd, editor, Proc. 1995 Int. Logic Programming Symp., pages 543\u2013557, MIT Press, 1995."},{"key":"17_CR19","unstructured":"K.K. Lau and M. Ornaghi. The relationship between logic programs and specifications \u2014 the subset example revisited. To appear in J. Logic Programming."},{"issue":"8","key":"17_CR20","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/32.153379","volume":"18","author":"Z. Manna","year":"1992","unstructured":"Z. Manna and R. Waldinger. Fundamentals of deductive program synthesis. IEEE Trans. on Soft. Eng. 18(8):53\u201379, 1992.","journal-title":"IEEE Trans. on Soft. Eng."},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1006\/jsco.1994.1036","volume":"18","author":"P. Miglioli","year":"1994","unstructured":"P. Miglioli, U. Moscato and M. Ornaghi. Abstract parametric classes and abstract data types defined by classical and constructive logical methods. J. Symb. Comp. 18:41\u201381, 1994.","journal-title":"J. Symb. Comp."},{"issue":"3","key":"17_CR22","first-page":"10","volume":"8","author":"R.A. O'Keefe","year":"1995","unstructured":"R.A. O'Keefe. What does subset mean? ALP Newsletter 8(3):10, August 1995.","journal-title":"ALP Newsletter"},{"key":"17_CR23","unstructured":"J.M. Spivey. Understanding Z. Cambridge University Press, 1988."},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"M. Wirsing. Algebraic specification. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 675\u2013788. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50018-4"}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62718-9_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:57:23Z","timestamp":1713635843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62718-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627180","9783540684947"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-62718-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}