{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T02:26:50Z","timestamp":1774837610712,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1981,10,1]],"date-time":"1981-10-01T00:00:00Z","timestamp":370742400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11612,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1981,10]]},"DOI":"10.1016\/0167-6423(81)90004-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:19:32Z","timestamp":1027642772000},"page":"5-48","source":"Crossref","is-referenced-by-count":42,"title":["Deductive synthesis of the unification algorithm"],"prefix":"10.1016","volume":"1","author":[{"given":"Zohar","family":"Manna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Waldinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0167-6423(81)90004-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(77)90012-1","article-title":"Non-resolution theorem proving","volume":"9","author":"Bledsoe","year":"1977","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/0167-6423(81)90004-6_BIB2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/321864.321875","article-title":"Proving theorems about LISP functions","volume":"22","author":"Boyer","year":"1975","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0167-6423(81)90004-6_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1093\/comjnl\/23.1.61","article-title":"Algorithm classification through synthesis","volume":"23","author":"Clark","year":"1980","journal-title":"Comput. J."},{"key":"10.1016\/0167-6423(81)90004-6_BIB4","series-title":"Internal Report","article-title":"Etude et r\u00e9alisation d'un syst\u00e8me Prolog","author":"Colmerauer","year":"1979"},{"key":"10.1016\/0167-6423(81)90004-6_BIB5","first-page":"219","author":"Green","year":"1969","journal-title":"Application of theorem proving to problem solving"},{"key":"10.1016\/0167-6423(81)90004-6_BIB6","series-title":"From Frege to G\u00f6del: A Source Book in Mathematical Logic, 1879\u20131931","first-page":"525","article-title":"Researches in the theory of demonstration","author":"Herbrand","year":"1967"},{"key":"10.1016\/0167-6423(81)90004-6_BIB7","series-title":"Ph.D. thesis","article-title":"Description and theoretical analysis (using schemata) of PLANNER: A language for proving theorems and manipulating models in a robot","author":"Hewitt","year":"1971"},{"issue":"1","key":"10.1016\/0167-6423(81)90004-6_BIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(81)90004-6_BIB9","first-page":"96","author":"Huet","year":"1980","journal-title":"Proofs by induction in equational theories with constructors"},{"key":"10.1016\/0167-6423(81)90004-6_BIB10","first-page":"175","author":"Livesay","year":"1979","journal-title":"Unification problems for combinations of associativity, commutativity, distributivity and idempotence axiom"},{"issue":"2","key":"10.1016\/0167-6423(81)90004-6_BIB11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0004-3702(75)90008-9","article-title":"Knowledge and reasoning in program synthesis","volume":"6","author":"Manna","year":"1975","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/0167-6423(81)90004-6_BIB12","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/357084.357090","article-title":"A deductive approach to program synthesis","volume":"2","author":"Manna","year":"1980","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0167-6423(81)90004-6_BIB13","unstructured":"Z. Manna and R. Waldinger, Deductive Basis for Computer Programming, forthcoming."},{"key":"10.1016\/0167-6423(81)90004-6_BIB14","series-title":"Internal Report","article-title":"Unification in linear time and space: a structured presentation","author":"Martelli","year":"1976"},{"issue":"2","key":"10.1016\/0167-6423(81)90004-6_BIB15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","article-title":"Linear unification","volume":"16","author":"Paterson","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6423(81)90004-6_BIB16","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1111\/j.1755-2567.1960.tb00558.x","article-title":"An improved proof procedure","volume":"26","author":"Prawitz","year":"1960","journal-title":"Theoria"},{"issue":"1","key":"10.1016\/0167-6423(81)90004-6_BIB17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(81)90004-6_BIB18","first-page":"71","author":"Stickel","year":"1975","journal-title":"A complete unification algorithm for associative-commutative functions"},{"key":"10.1016\/0167-6423(81)90004-6_BIB19","first-page":"156","author":"Von Henke","year":"1974","journal-title":"A methodology for verifying programs"},{"key":"10.1016\/0167-6423(81)90004-6_BIB20","first-page":"241","author":"Waldinger","year":"1969","journal-title":"PROW: A step toward automatic program writing"},{"key":"10.1016\/0167-6423(81)90004-6_BIB21","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0004-3702(74)90015-0","article-title":"Reasoning about programs","volume":"5","author":"Waldinger","year":"1974","journal-title":"Artificial Intelligence"},{"issue":"8","key":"10.1016\/0167-6423(81)90004-6_BIB22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/872734.806939","article-title":"PROLOG\u2014the language and its implementation compared with LISP","volume":"12","author":"Warren","year":"1977","journal-title":"SIGPLAN-ACM Notices"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642381900046?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642381900046?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:28:49Z","timestamp":1555057729000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642381900046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,10]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1981,10]]}},"alternative-id":["0167642381900046"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(81)90004-6","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1981,10]]}}}