{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:29:16Z","timestamp":1672691356544},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf01536404","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T02:38:02Z","timestamp":1113878282000},"page":"437-456","source":"Crossref","is-referenced-by-count":4,"title":["On computability by logic programs"],"prefix":"10.1007","volume":"15","author":[{"given":"Andrei","family":"Voronkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"3","volume":"4","author":"H. Andr\ufffdka","year":"1978","unstructured":"H. Andr\ufffdka and I. N\ufffdmeti, The generalized completeness of horn clause logic seen as a programming language, Acta Cybernetica 4 (1978) 3?10.","journal-title":"Acta Cybernetica"},{"key":"CR2","unstructured":"Yu.L. Ershov,Theory of Enumerations (in Russian) (Nauka, 1977)."},{"issue":"3","key":"CR3","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi, Declarative modeling of the operational behavior of logic languages, Theor. Comp. Sci. 69(3) (1989) 298?318.","journal-title":"Theor. Comp. Sci."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321850.321857","volume":"21","author":"L. Henshen","year":"1974","unstructured":"L. Henshen and L. Wos, Unit refutation and Horn sets, J. ACM 21 (1974) 590?605.","journal-title":"J. ACM"},{"key":"CR5","unstructured":"P.M. Hill and J.W. Lloyd, The G\ufffddel report, Technical Report TR-91-02, Univ. of Bristol, Department of Computer Science (1991)."},{"key":"CR6","unstructured":"Matiyasevi?, The diophantiness of recursively enumerable sets (in Russian), Sov. Math. Doklady (1970) 279?282."},{"key":"CR7","unstructured":"M. Minsky,Computation: Finite and Infinite Machines (Prentice Hall, 1967)."},{"key":"CR8","unstructured":"H. Rogers,Theory of Recursive Functions and Effective Computability (McGraw Hill, 1967)."},{"key":"CR9","unstructured":"P. ?t?p\ufffdnek and J. ?ebel\ufffdk, Horn clause programs for recursive functions, in K.L. Clark and S.-\ufffd. T\ufffdrnlund, editors,Logic Programming (Academic Press, 1982) pp. 325?340."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"J.C. Sheperdson, Negation in logic programming, in J. Minker, editor,Deductive Databases and Logic Programming (Morgan Kaufmann, 1988) pp. 19?88.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"issue":"3","key":"CR11","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/72551.72555","volume":"21","author":"E. Shapiro","year":"1989","unstructured":"E. Shapiro, A family of concurrent logic programming languages, ACM Comput. Surveys 21(3) (1989) 412?510.","journal-title":"ACM Comput. Surveys"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01932293","volume":"17","author":"S.-\ufffd. T\ufffdrnlund","year":"1977","unstructured":"S.-\ufffd. T\ufffdrnlund, Horn clause computability, BIT 17 (1977) 215?216.","journal-title":"BIT"},{"key":"CR13","unstructured":"A. Voronkov, On computability by logic programs, in H. Blair, W. Marek, A. Nerode, and J. Remmel, editors,Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming (Washington, D.C., 1992) pp. 165?174."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01536404\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01536404.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01536404\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01536404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T09:47:29Z","timestamp":1556876849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01536404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":13,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01536404"],"URL":"https:\/\/doi.org\/10.1007\/bf01536404","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}