{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:20Z","timestamp":1725663260843},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_35","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:42:54Z","timestamp":1330206174000},"page":"98-115","source":"Crossref","is-referenced-by-count":4,"title":["Generalizing allowedness while retaining completeness of SLDNF-resolution"],"prefix":"10.1007","author":[{"given":"Hendrik","family":"Decker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Cavedon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"7_CR1","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., Walker, A., Towards a theory of declarative knowledge, in J. Minker (ed), Foundations of Deductive Databases and Logic Programming, Morgan Kaufman, Los Altos, 1988, 89\u2013148."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Barbuti, R., Martelli, M., Completeness of the SLDNF-resolution for a class of logic programs, Proc. 3rd Int. Conf. on Logic Programming, London, 1986, 600\u2013614.","DOI":"10.1007\/3-540-16492-8_109"},{"key":"7_CR3","unstructured":"Barbuti, R., Martelli, M., A characterization of non-floundering logic programs and goals based on abstract interpretation techniques, manuscript, Univ. of Pisa, 1988."},{"key":"7_CR4","unstructured":"Bruynooghe, M., Janssens, G., Callebaut, A., Demoen, B., Abstract interpretation: towards the global optimization of Prolog programs, Proc. 4th Int. Symp. on Logic Programming, San Francisco, 1987, 192\u2013204."},{"key":"7_CR5","unstructured":"Balbin, I., Port, G.S., Ramamohanarao, K., Magic set computations for stratified databases, TR 87\/3, Dept. of Comp. Sc., Univ. Melbourne, Australia, 1987. To appear in J. Logic Programming."},{"key":"7_CR6","volume-title":"On the completeness of SLDNF-resolution, TR 88\/17","author":"L. Cavedon","year":"1988","unstructured":"Cavedon, L., On the completeness of SLDNF-resolution, TR 88\/17, Dept. of Comp. Sc., Univ. Melbourne, Australia, 1988."},{"key":"7_CR7","unstructured":"Cavedon, L., Continuity, consistency, and completeness properties for logic programs, Proc. 6th Int. Conf. on Logic Programming, Lisbon, 1989, 571\u2013584."},{"issue":"3","key":"7_CR8","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., Lloyd, J.W., A completeness theorem for SLDNF resolution, J. Logic Programming 7,3:177\u2013191, 1989.","journal-title":"J. Logic Programming"},{"key":"7_CR9","unstructured":"Cholak, P., Post correspondence problem and Prolog programs, manuscript, Dept. of Mathematics, Univ. Wisconsin, 1988."},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. Clark","year":"1978","unstructured":"Clark, K., Negation as failure, in H. Gallaire, J. Minker (eds), Logic and Data Bases, Plenum Press, New York, 1978, 293\u2013322."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Decker, H., Cavedon, L., Generalizing allowedness while retaining completeness (long version), IR-KB-52, ECRC, 1990.","DOI":"10.1007\/3-540-52753-2_35"},{"key":"7_CR12","volume-title":"On derived dependencies and connected databases","author":"P. Dart","year":"1988","unstructured":"Dart, P., On derived dependencies and connected databases, manuscript, Dept. of Comp. Sc., Univ. Melbourne, Australia, 1988. To appear in J. Logic Programming."},{"key":"7_CR13","unstructured":"Decker, H., Domain-independent and range-restricted formulas and deductive databases, Proc. S\u00e9minaire sur la Programmation en Logique, CNET, Tr\u00e9gastel, France, 1988, 385\u2013397."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Decker, H., The range form of databases and queries, or: How to avoid floundering, Proc. 5th \u00d6GAI, Informatik Fachberichte 218, Springer, 1989, 114\u2013123.","DOI":"10.1007\/978-3-642-74688-8_13"},{"key":"7_CR15","unstructured":"Decker, H., Some generalizations of conditions which ensure the completeness of query evaluation, IR-KB-50, ECRC, 1988."},{"issue":"4","key":"7_CR16","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., A Kripke-Kleene semantics for logic programs, J. Logic Programming, 2,4:295\u2013312, 1985.","journal-title":"J. Logic Programming"},{"key":"7_CR17","unstructured":"Jaffar, J., Lassez, J.-L. and Lloyd J.W., Completeness of the negation as failure rule, IJCAI-83, Karlsruhe, 1983, 500\u2013506."},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kunen, K., Negation in logic programming, J. Logic Programming, 4,4:289\u2013308, 1987.","journal-title":"J. Logic Programming"},{"issue":"3","key":"7_CR19","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., Signed data dependencies in logic programs, J. Logic Programming 7,3:231\u2013245, 1989.","journal-title":"J. Logic Programming"},{"key":"7_CR20","unstructured":"Kunen, K., Some remarks on the completed database, Proc. 5th Intl. Conf. and Symp. on Logic Programming, 1988, 978\u2013992."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W., Foundations of Logic Programming, second edition, Symbolic Computation Series, Springer, 1987 (first edition appeared 1984).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"7_CR22","unstructured":"Lloyd, J.W., Shepherdson, J.C., Partial evaluation in logic program, TR-87-09, revised version, Comp. Sc. Dept., Univ. Bristol, 1989."},{"issue":"3","key":"7_CR23","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"J.W. Lloyd","year":"1984","unstructured":"Lloyd, J.W. and Topor, R.W., Making Prolog more expressive, J. Logic Programming 1,3:225\u2013240, 1984.","journal-title":"J. Logic Programming"},{"issue":"1","key":"7_CR24","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., A basis for deductive database systems II, J. Logic Programming 3,1:55\u201367, 1986.","journal-title":"J. Logic Programming"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Mellish, C.S., Abstract interpretation of Prolog programs, Proc. 3rd Int. Conf. on Logic Programming, London, 1986, 463\u2013474.","DOI":"10.1007\/3-540-16492-8_95"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Przymusinska, H., Przymusinski, T., Semantic issues in deductive databases and logic programs, to appear in A. Banerji (ed), Sourcebook on the Formal Approaches in Artificial Intelligence, North Holland, 1989.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"7_CR27","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/B978-0-934613-40-8.50009-9","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T. Przymusinski","year":"1988","unstructured":"Przymusinski, T., On the declarative and procedural semantics of stratified deductive databases, in J. Minker (ed), Foundations of Deductive Databases and Logic Programming, Morgan Kaufman, Los Altos, 193\u2013216, 1988."},{"key":"7_CR28","unstructured":"Sato, T., Completed logic programs and their consistency, manuscript, Electrotechnical Lab., Ibaraki, 1988. To appear in J. Logic Programming."},{"issue":"1","key":"7_CR29","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., Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption, J. Logic Programming, 1,1:51\u201379, 1984.","journal-title":"J. Logic Programming"},{"issue":"3","key":"7_CR30","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., Negation as failure II, J. Logic Programming, 2,3:185\u2013202, 1985.","journal-title":"J. Logic Programming"},{"key":"7_CR31","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., Negation in logic programming, in J. Minker (ed), Foundations of Deductive Databases and Logic Programming, Morgan Kaufman, Los Altos, 1988, 19\u201388."},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(89)90106-0","volume":"65","author":"J.C. Shepherdson","year":"1989","unstructured":"Shepherdson, J.C., A sound and complete semantics for a version of negation as failure, Theoretical Computer Science, 65, 343\u2013371, 1989","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"7_CR33","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(87)90113-7","volume":"52","author":"R.W. Topor","year":"1987","unstructured":"Topor, R.W., Domain independent formulas and databases, Theoretical Computer Science, 52,3:281\u2013307, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"7_CR34","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","volume":"10","author":"J.D. Ullman","year":"1985","unstructured":"J.D. Ullman, Implementation of logical query languages for databases, ACM ToDS 10,3:289\u2013321, 1985.","journal-title":"ACM ToDS"},{"issue":"4","key":"7_CR35","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden van","year":"1976","unstructured":"van Emden, M.H., Kowalski, R., The semantics of predicate logic as a programming language, JACM 23,4:733\u2013742, 1976.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:08Z","timestamp":1605648308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}