{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T14:26:33Z","timestamp":1673360793747},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1007\/bf02432149","type":"journal-article","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:18:46Z","timestamp":1153991926000},"page":"155-170","source":"Crossref","is-referenced-by-count":8,"title":["Negation as Failure. Completeness of the Query Evaluation Process for horn clause programs with recursive definitions"],"prefix":"10.1007","volume":"2","author":[{"given":"C.","family":"Aquilano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Barbuti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Bocchetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Martelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02432149_CR1","unstructured":"Aquilano, C. and Bocchetti, P., \u2018Caratterizzazione di una teoria in clausole Horn per una deduzione completa di informazioni negative\u2019, Master's Thesis, Dept. of Comp. Science, University of Pisa, (1985)."},{"key":"BF02432149_CR2","unstructured":"Asirelli, P., Barbuti, R., and Levi, G., \u2018Types and declarative static type checking in logic programming\u2019, Proc. Programming '84, Primorsko, Bulgary (1984)."},{"key":"BF02432149_CR3","unstructured":"Barbuti, R. and Martelli, M., \u2018Programming in a generally functional style to design logic databases\u2019, CASE Center Technical Report No. 8602, Syracuse University (1986)."},{"key":"BF02432149_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"ClarkK. L., Negation as Failure, inLogic and Data Bases (eds. H.Gallaire, and J.Minker), Plenum, New York, pp. 293\u2013322 (1978)."},{"key":"BF02432149_CR5","unstructured":"Jaffar, J., Lassez, J.-L., and Lloyd, J. W., \u2018Completeness of the Negation-as-Failure Rule\u2019,Proc. 8th IJCAI, Karlsruhe (1983), pp. 500\u2013506."},{"key":"BF02432149_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","volume":"29","author":"J.-L. Lassez","year":"1984","unstructured":"LassezJ.-L. and MaherM. J., Closures and fairness in the semantics of programming logic\u2019,Theoretical Computer Science,29, 167\u2013184, (1984).","journal-title":"Theoretical Computer Science"},{"key":"BF02432149_CR7","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W.,Foundations of Logic Programming, Springer-Verlag, Symbolic Computation Series, (1984).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"BF02432149_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0743-1066(85)90013-5","volume":"2","author":"J. W. Lloyd","year":"1985","unstructured":"LloydJ. W. and ToporR. W., \u2018A basis for deductive data base systems\u2019,J. Logic Programming 2, 93\u2013109, (1985).","journal-title":"J. Logic Programming"},{"key":"BF02432149_CR9","unstructured":"Mycroft, A. and O'Keefe, R., \u2018A polymorphic type system for PROLOG\u2019,Proc. Logic Programming Workshop, Portugal (1983) pp. 107\u2013122."},{"key":"BF02432149_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4684-3384-5_3","volume-title":"Logic and Data Bases","author":"R. Reiter","year":"1978","unstructured":"ReiterR., \u2018On closed world data bases\u2019, inLogic and Data Bases, (eds. H.Gallaire, and J.Minker), Plenum, New York, 55\u201376, (1978)."},{"key":"BF02432149_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","volume":"1","author":"J. C. Shepherdson","year":"1984","unstructured":"ShepherdsonJ. C., \u2018Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption.J. Logic Programming 1, 51\u201379, (1984).","journal-title":"J. Logic Programming"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02432149.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02432149\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02432149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T18:21:28Z","timestamp":1558117288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02432149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["BF02432149"],"URL":"https:\/\/doi.org\/10.1007\/bf02432149","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}