{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:21Z","timestamp":1725662961158},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540074106"},{"type":"electronic","value":"9783540379294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07410-4_667","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:00:12Z","timestamp":1330167612000},"page":"667-679","source":"Crossref","is-referenced-by-count":0,"title":["First order logic as a tool to solve and classify problems"],"prefix":"10.1007","author":[{"given":"D.","family":"Marini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. A.","family":"Miglioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ornaghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"51_CR1","unstructured":"Kleene S.C. \u2014 INTRODUCTION TO METAMATHEMATICS \u2014 Amsterdam, 1967"},{"key":"51_CR2","unstructured":"Kowalski R., Hayes P.J. \u2014 SEMANTICAL TREE IN AUTOMATIC THEOREM PROVING in: Machine Intelligence vol. 4, New York, 1969"},{"key":"51_CR3","unstructured":"Kowalski R. \u2014 PREDICATE LOGIC AS A PROGRAMMING LANGUAGE \u2014 Proc. of IFIP, 1974"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Robinson J.A. \u2014 A MACHINE ORIENTED LOGIC BASED ON THE RESOLUTION PRINCIPLE Journal of the ACM,vol.12, 1965","DOI":"10.1145\/321250.321253"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Meltzer B. \u2014 THEOREM PROVING FOR COMPUTERS: SOME RESULTS ON RESOLUTION AND RENAMING \u2014 Computer J., 8, 1966","DOI":"10.1093\/comjnl\/8.4.341"},{"key":"51_CR6","unstructured":"Black F. \u2014 A DEDUCTIVE QUESTION ANSWERING SYSTEM \u2014 in: Semantic Information Processing, Minsky ed., Cambridge, 1964"},{"key":"51_CR7","unstructured":"Green C. \u2014 THEOREM PROVING BY RESOLUTION AS A BASIS FOR QUESTION ANSWERING SYSTEM in: Machine Intelligence, vol. 4, New York, 1969"},{"key":"51_CR8","unstructured":"Nilsson N.J. \u2014 PROBLEM SOLVING METHODS IN ARTIFICIAL INTELLIGENCE \u2014 New York, 1971"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Green C. \u2014 THE APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING \u2014 Proc. Ist. Intern. Joint Conf. on Artificial Intelligence, 1969","DOI":"10.21236\/ADA459656"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Manna Z., Waldinger R.J. \u2014 TOWARDS AUTOMATIC PROGRAM SYNTHESIS \u2014 in: Lecture Notes on Mathematics, Springer, 1971","DOI":"10.1007\/BFb0059702"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Lee R.C.T., Chang C.L., Waldinger R.J. \u2014 AN IMPROVED PROGRAM SYNTHESIZING ALGORITHM AND ITS CORRECTNESS \u2014 Com. ACM, 4, 1974","DOI":"10.1145\/360924.360967"},{"key":"51_CR12","unstructured":"Chang C.L., Lee R.C.T. \u2014 SYMBOLIC LOGIC AND MECHANICAL THEOREM PROVING \u2014 New York 1973"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Degli Antoni G., Miglioli P.A., Ornaghi M. \u2014 THE SYNTHESIS OF PROGRAMS IN AN INTUITIONISTIC FRAME \u2014 Report of Gruppo di Elettronica e Cibernetica (enlarged version of: Top down approach to the synthesis of programs\" \u2014 Colloque sur la Programmation Paris, 1974","DOI":"10.1007\/3-540-06859-7_127"},{"key":"51_CR14","unstructured":"Miglioli P.A. \u2014 NOTE SUI LINGUAGGI DI PROGRAMMAZIONE E SULLE MAPPE DI SINTESI \u2014 Atti del Convegno di Informatica Teorica, Mantova, 1974 (An english version is available)."},{"key":"51_CR15","unstructured":"Degli Antoni G., Miglioli P.A., Ornaghi M. \u2014 THE SYNTHESIS OF PROGRAMS AS AN APPROACH TO THE CONSTRUCTION OF RELIABLE PROGRAMS \u2014 Proc. of the Int. Conf. on Proving and Improving Programs,Arc et Senans, 1975"}],"container-title":["Lecture Notes in Computer Science","GI \u2014 5. Jahrestagung"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07410-4_667.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:57:46Z","timestamp":1605625066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07410-4_667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074106","9783540379294"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-07410-4_667","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}