{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:14:46Z","timestamp":1757780086606},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1007\/bf03037151","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T01:44:38Z","timestamp":1240364678000},"page":"69-79","source":"Crossref","is-referenced-by-count":15,"title":["Strict completion of Logic Programs"],"prefix":"10.1007","volume":"9","author":[{"given":"Wlodzimierz","family":"Drabent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Martelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037151_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02432149","volume":"2","author":"C. Aquilano","year":"1986","unstructured":"Aquilano, C., Barbuti, R., Bocchetti, P., and Martelli, M., \u201cNegation as Failure: Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions,\u201dJournal of Automated Reasoning, 2, pp. 155\u2013170, 1986.","journal-title":"Journal of Automated Reasoning"},{"key":"BF03037151_CR2","doi-asserted-by":"crossref","unstructured":"Apt, K. R., \u201cIntroduction to Logic Programming,\u201dHandbook of Theoretical Computer Science (J. van Leeuwen ed.), Elsevier Sc. Pub., pp. 493\u2013574, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"BF03037151_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. R. Apt","year":"1988","unstructured":"Apt, K. R., Blair, H. A., and Walker, A., \u201cTowards a Theory of Declarative Knowledge,\u201dFoundations of Deductive Databases and Logic Programming (J. Minker ed.), Morgan Kaufmann, Los Altos, pp. 89\u2013148, 1988."},{"key":"BF03037151_CR4","doi-asserted-by":"crossref","unstructured":"Barbuti, R. and Martelli, M., \u201cCompleteness of the SLDNF-resolution for a Class of Logic Programs,\u201dProc. 3rd Int. Conf. on Logic Programming, LNCS 225, Springer Verlag, pp. 600\u2013614, 1986.","DOI":"10.1007\/3-540-16492-8_109"},{"key":"BF03037151_CR5","unstructured":"Barbuti, R. and Martelli, M., \u201cProgramming in a Generally Functional Style to Design Logic Databases,\u201dInt. Rep. of CASE Center, Syracuse University, 1985. AlsoProc. Workshop on Foundations of Deductive Databases and Logic Programming, Washington, 1986."},{"issue":"2","key":"BF03037151_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1142\/S0129054190000126","volume":"1","author":"R. Barbuti","year":"1990","unstructured":"Barbuti, R. and Martelli, M., \u201cRecognizing Non-floundering Logic Programs and Goals,\u201dInt. Journal of Foundations of Computer Science, 1, 2, pp. 151\u2013163, 1990.","journal-title":"Int. Journal of Foundations of Computer Science"},{"issue":"4","key":"BF03037151_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0743-1066(89)90020-4","volume":"7","author":"L. Cavedon","year":"1989","unstructured":"Cavedon, L. and Lloyd, J. W., \u201cA Completeness Theorem for SLDNF-resolution,\u201dJ. Logic Programming, 7, 4, pp. 177\u2013193, 1989.","journal-title":"J. Logic Programming"},{"key":"BF03037151_CR8","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":"Clark, K. L., \u201cNegation as Failure,\u201dLogic and Data Bases (H. Gallaire and J. Minker eds.), Plenum Press, New York, pp. 293\u2013322, 1978."},{"issue":"4","key":"BF03037151_CR9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"Fitting, M., \u201cA Kripke-Kleene Semantics for Logic Programs,\u201dJ. Logic Programming, 2, 4, pp. 295\u2013312, 1985.","journal-title":"J. Logic Programming"},{"key":"BF03037151_CR10","unstructured":"Jaffar, J., Lassez, J-L., and Lloyd J. W., \u201cCompleteness of the Negation as Failure Rule,\u201dIJCAI 83, Karlsruhe, pp. 500\u2013506, 1983."},{"issue":"4","key":"BF03037151_CR11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kunen, K., \u201cNegation in Logic Programming,\u201dJ. Logic Programming, 4, 4, pp. 289\u2013308, 1987.","journal-title":"J. Logic Programming"},{"issue":"4","key":"BF03037151_CR12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","volume":"7","author":"K. Kunen","year":"1989","unstructured":"Kunen, K., \u201cSigned Data Dependencies in Logic Programs,\u201dJ. Logic Programming, 7, 4, pp. 231\u2013245, 1989.","journal-title":"J. Logic Programming"},{"key":"BF03037151_CR13","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W.,Foundations of Logic Programming, Second Edition, Symbolic Computation Series, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"1","key":"BF03037151_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0743-1066(86)90004-X","volume":"3","author":"J. W. Lloyd","year":"1986","unstructured":"Lloyd, J. W. and Topor, R. W., \u201cA Basis for Deductive Database Systems II,\u201dJ. Logic Programming, 3, 1, pp. 55\u201367, 1986.","journal-title":"J. Logic Programming"},{"issue":"1","key":"BF03037151_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","volume":"1","author":"J. C. Shepherdson","year":"1984","unstructured":"Shepherdson, J. C., \u201cNegation as Failure: A Comparison of Clark\u2019s Completed Data Base and Reiter\u2019s Closed Word Assumption,\u201dJ. Logic Programming, 1, 1, pp. 51\u201379, 1984.","journal-title":"J. Logic Programming"},{"issue":"3","key":"BF03037151_CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(85)90018-4","volume":"2","author":"J. C. Shepherdson","year":"1985","unstructured":"Shepherdson, J. C., \u201cNegation as Failure II,\u201dJ. Logic Programming, 2, 3, pp. 185\u2013202, 1985.","journal-title":"J. Logic Programming"},{"key":"BF03037151_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/B978-0-934613-40-8.50005-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J. C. Shepherdson","year":"1988","unstructured":"Shepherdson, J. C., \u201cNegation in Logic Programming,\u201dFoundations of Deductive Databases and Logic Programming (J. Minker ed.), Morgan Kaufmann, Los Altos, pp. 19\u201388, 1988."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037151.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037151\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:30Z","timestamp":1558572750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["BF03037151"],"URL":"https:\/\/doi.org\/10.1007\/bf03037151","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}