{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:10:55Z","timestamp":1774797055969,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"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":10640,"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":[[1984,6]]},"DOI":"10.1016\/0743-1066(84)90022-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"35-50","source":"Crossref","is-referenced-by-count":152,"title":["On the sequential nature of unification"],"prefix":"10.1016","volume":"1","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[]},{"given":"Paris C.","family":"Kanellakis","sequence":"additional","affiliation":[]},{"given":"John C.","family":"Mitchell","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(84)90022-0_BIB1","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/358141.358144","article-title":"An Overview of Computational Complexity","volume":"26","author":"Cook","year":"1983","journal-title":"Commun. ACM"},{"key":"10.1016\/0743-1066(84)90022-0_BIB2","article-title":"Maximal Parallelism in Matrix Multiplication","author":"Chandra","year":"1976","journal-title":"RC 6193"},{"key":"10.1016\/0743-1066(84)90022-0_BIB3","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"key":"10.1016\/0743-1066(84)90022-0_BIB4","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","article-title":"Variations on the Common Subexpression Problem","volume":"27","author":"Downey","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(84)90022-0_BIB5","first-page":"114","article-title":"Parallelism in Random Access Machines","author":"Fortune","year":"1978","journal-title":"Proc 10th ACM STOC"},{"key":"10.1016\/0743-1066(84)90022-0_BIB6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","article-title":"The Monotone and Planar Circuit Value Problems are Log Space Complete for P","volume":"9","author":"Goldschlager","year":"1977","journal-title":"SIGACT News"},{"key":"10.1016\/0743-1066(84)90022-0_BIB7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","article-title":"The Maximum Flow Problem is Log Space Complete for P","volume":"21","author":"Goldschlager","year":"1982","journal-title":"Theor. Computer Sci."},{"key":"10.1016\/0743-1066(84)90022-0_BIB8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1137\/0212012","article-title":"On Proving Uniform Termination and Restricted Termination of Rewriting Systems","volume":"12","author":"Guttag","year":"1983","journal-title":"Siam J. Computing"},{"key":"10.1016\/0743-1066(84)90022-0_BIB9","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","article-title":"Computing Connected Components on Parallel Computers","volume":"22","author":"Hirschberg","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/0743-1066(84)90022-0_BIB10","first-page":"164","article-title":"Complexity of Finitely Presented Algebras","author":"Kozen","year":"1977","journal-title":"Proc. 9th ACM STOC"},{"key":"10.1016\/0743-1066(84)90022-0_BIB11","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0020-0190(82)90121-1","article-title":"Unifiability is Complete for co-NLOGSPACE","volume":"15","author":"Lewis","year":"1982","journal-title":"Info. Process. Lett."},{"key":"10.1016\/0743-1066(84)90022-0_BIB12","first-page":"348","article-title":"A Theory of Type Polymorphism in Programming","volume":"17","author":"Milner","year":"1978","journal-title":"JCSS"},{"issue":"2","key":"10.1016\/0743-1066(84)90022-0_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/357162.357169","article-title":"An Efficient Unification Algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0743-1066(84)90022-0_BIB14","doi-asserted-by":"crossref","unstructured":"MacQueen, D., Plotkin, G., and Sethi, R., An Ideal Model for Recursive Polymorphic Types, Proc. 1984 ACM POPL, to appear.","DOI":"10.1145\/800017.800528"},{"key":"10.1016\/0743-1066(84)90022-0_BIB15","first-page":"158","article-title":"Linear Unification","volume":"16","author":"Paterson","year":"1978","journal-title":"JCSS"},{"key":"10.1016\/0743-1066(84)90022-0_BIB16","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\/0743-1066(84)90022-0_BIB17","article-title":"A Subset of Concurrent Prolog and its Interpreter","author":"Shapiro","year":"1983","journal-title":"ICOT report TR-003"},{"key":"10.1016\/0743-1066(84)90022-0_BIB18","series-title":"Research Report ER 83-01","article-title":"On the Parallel Computational Complexity of Unification","author":"Yasuura","year":"1983"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106684900220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106684900220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:26:07Z","timestamp":1580901967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106684900220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["0743106684900220"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(84)90022-0","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}