{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T21:29:53Z","timestamp":1672694993571},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":7749,"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":[[1992,5]]},"DOI":"10.1016\/0743-1066(92)90020-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"23-55","source":"Crossref","is-referenced-by-count":8,"title":["Deterministic and nondeterministic computation, and horn programs, on abstract data types"],"prefix":"10.1016","volume":"13","author":[{"given":"J.V.","family":"Tucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.I.","family":"Zucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(92)90020-4_BIB1","series-title":"Admissible Sets and Structures","author":"Barwise","year":"1975"},{"key":"10.1016\/0743-1066(92)90020-4_BIB2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF00243207","article-title":"A more expressive formulation of many-sorted logic","volume":"3","author":"Cohn","year":"1987","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0743-1066(92)90020-4_BIB3","article-title":"Fundamentals of Algebraic Specification I: Equations and Initial Semantics","volume":"Vol. 6","author":"Ehrig","year":"1985"},{"key":"10.1016\/0743-1066(92)90020-4_BIB4","series-title":"Formal Languages: Automata and Structures","author":"Engeler","year":"1968"},{"key":"10.1016\/0743-1066(92)90020-4_BIB5","series-title":"Fundamentals of Generalized Recursion Theory","author":"Fitting","year":"1981"},{"key":"10.1016\/0743-1066(92)90020-4_BIB6","series-title":"Computability Theory, Semantics and Logic Programming","author":"Fitting","year":"1987"},{"key":"10.1016\/0743-1066(92)90020-4_BIB7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","article-title":"Equality, types, modules and (why not?) generics for logic programming","volume":"2","author":"Goguen","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90020-4_BIB8","series-title":"Current Trends in Programming Methodology, Vol. 4: Data Structuring","article-title":"An initial approach to the specification, correctness and implementation of abstract data types","author":"Goguen","year":"1978"},{"key":"10.1016\/0743-1066(92)90020-4_BIB9","first-page":"333","article-title":"Comparisons between some generalizations of recursion theory","volume":"22","author":"Gordon","year":"1970","journal-title":"Compositio Mathematica"},{"key":"10.1016\/0743-1066(92)90020-4_BIB10","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0743-1066(92)90020-4_BIB11","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(92)90020-4_BIB12","series-title":"Algebraic Systems","author":"Mal'cev","year":"1973"},{"key":"10.1016\/0743-1066(92)90020-4_BIB13","series-title":"Logic, Methodology and Philosophy of Science III","article-title":"Recursion theory as a branch of model theory","author":"Montague","year":"1968"},{"key":"10.1016\/0743-1066(92)90020-4_BIB14","first-page":"427","article-title":"Abstract first order computability. I","volume":"138","author":"Moschovakis","year":"1969","journal-title":"Trans. AMS"},{"key":"10.1016\/0743-1066(92)90020-4_BIB15","series-title":"Elementary Induction on Abstract Structures","author":"Moschovakis","year":"1974"},{"key":"10.1016\/0743-1066(92)90020-4_BIB16","series-title":"Logic Programming","article-title":"Horn clause programs for recursive functions","author":"Sebel\u00edk","year":"1982"},{"key":"10.1016\/0743-1066(92)90020-4_BIB17","series-title":"Heyting '88: Proceedings of the Summer School and Conference on Mathematical Logic, Varna, Bulgaria, Sept.","article-title":"On the computational power of the logic programs","author":"Soskov","year":"1988"},{"key":"10.1016\/0743-1066(92)90020-4_BIB18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01932293","article-title":"Horn clause computability","volume":"17","author":"T\u00e4rnlund","year":"1977","journal-title":"BIT"},{"key":"10.1016\/0743-1066(92)90020-4_BIB19","series-title":"Program Correctness over Abstract Data Types, with Error-State Semantics. CWI Monograph Series","author":"Tucker","year":"1988"},{"key":"10.1016\/0743-1066(92)90020-4_BIB20","series-title":"Proceedings of the 16th International Colloquium on Automata, Languages and Programming","article-title":"Horn programs and semicomputable relations on abstract structures","volume":"Vol. 372","author":"Tucker","year":"1989"},{"key":"10.1016\/0743-1066(92)90020-4_BIB21","series-title":"Proceedings of the 17th International Colloquium on Automata, Languages and Programming","article-title":"Provable computable functions on abstract data types","volume":"Vol. 443","author":"Tucker","year":"1990"},{"key":"10.1016\/0743-1066(92)90020-4_BIB22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1142\/S0129054191000170","article-title":"Projections of semicomputable relations on abstract data types","volume":"2","author":"Tucker","year":"1991","journal-title":"International J. Foundations of Computer Science"},{"key":"10.1016\/0743-1066(92)90020-4_BIB23","series-title":"Leeds Proof Theory 1990","article-title":"Provable computable selection functions on abstract structures","author":"Tucker","year":"1992"},{"key":"10.1016\/0743-1066(92)90020-4_BIB24","series-title":"Proceedings of a Summer Symposium","article-title":"Constructivity in Computer Science","author":"Tucker","year":"1991"},{"key":"10.1016\/0743-1066(92)90020-4_BIB25","series-title":"A Many-Sorted Calculus Based on Resolution and Paramodulation","author":"Walther","year":"1987"},{"key":"10.1016\/0743-1066(92)90020-4_BIB26","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00260922","article-title":"The algebraic specification of abstract data types","volume":"10","author":"Guttag","year":"1978","journal-title":"Acta Informatica"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106692900204?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106692900204?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:50Z","timestamp":1555127810000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106692900204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["0743106692900204"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(92)90020-4","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}