{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:46Z","timestamp":1759637806100,"version":"3.41.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Automated Reasoning"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1023\/a:1020116927466","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T13:36:10Z","timestamp":1047735370000},"page":"53-97","source":"Crossref","is-referenced-by-count":10,"title":["SLT-Resolution for the Well-Founded Semantics"],"prefix":"10.1007","volume":"28","author":[{"given":"Yi-Dong","family":"Shen","sequence":"first","affiliation":[]},{"given":"Li-Yan","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"382661_CR1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K. R. Apt","year":"1982","unstructured":"Apt, K. R. and Van Emden, M. H.: Contributions to the theory of logic programming, J. ACM29(3) (1982), 841-862.","journal-title":"J. ACM"},{"issue":"1","key":"382661_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90004-L","volume":"86","author":"R. N. Bol","year":"1991","unstructured":"Bol, R. N., Apt, K. R. and Klop, J. W.: An analysis of loop checking mechanisms for logic programs, Theoret. Comput. Sci.86(1) (1991), 35-79.","journal-title":"Theoret. Comput. Sci."},{"key":"382661_CR3","unstructured":"Bol, R. N. and Degerstedt, L.: The underlying search for magic templates and tabulation, in Proc. of the Tenth International Conference on Logic Programming, MIT Press, 1993."},{"issue":"2","key":"382661_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0743-1066(97)00073-3","volume":"34","author":"R. N. Bol","year":"1998","unstructured":"Bol, R. N. and Degerstedt, L.: Tabulated resolution for the well-founded semantics, J. Logic Programming34(2) (1998), 67-109.","journal-title":"J. Logic Programming"},{"key":"382661_CR5","first-page":"111","volume-title":"Proc. of the Fifth International Conference and Symposium on Logic Programming","author":"D. Chan","year":"1988","unstructured":"Chan, D.: Constructive negation based on the completed database, in R. A. Kowalski and K. A. Bowen (eds.), Proc. of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, Mass., 1988, pp. 111-125."},{"issue":"3","key":"382661_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","volume":"24","author":"W. D. Chen","year":"1995","unstructured":"Chen, W. D., Swift, T. and Warren, D. S.: Efficient top-down computation of queries under the well-founded semantics, J. Logic Programming24(3) (1995), 161-199.","journal-title":"J. Logic Programming"},{"issue":"1","key":"382661_CR7","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. D. Chen","year":"1996","unstructured":"Chen, W. D. and Warren, D. S.: Tabled evaluation with delaying for general logic programs, J. ACM43(1) (1996), 20-74.","journal-title":"J. ACM"},{"key":"382661_CR8","first-page":"293","volume-title":"Logic and Databases","author":"K. L. Clark","year":"1978","unstructured":"Clark, K. L.: Negation as failure, in H. Gallaire and J. Minker (eds.), Logic and Databases, Plenum, New York, 1978, pp. 293-322."},{"key":"382661_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19\/20","author":"D. De Schreye","year":"1993","unstructured":"De Schreye, D. and Decorte, S.: Termination of logic programs: The never-ending story, J. Logic Programming19\/20 (1993), 199-260.","journal-title":"J. Logic Programming"},{"issue":"1","key":"382661_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01185404","volume":"32","author":"W Drabent","year":"1995","unstructured":"Drabent, W.:What is failure? An approach to constructive negation, Acta Inform.32(1) (1995), 27-59.","journal-title":"Acta Inform."},{"key":"382661_CR11","first-page":"1070","volume-title":"Proc. of the Fifth International Conference and Symposium on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M. and Lifschitz, V.: The stable model semantics for logic programming, in R.A. Kowalski and K. A. Bowen (eds.), Proc. of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, Mass., 1988, pp. 1070-1080."},{"key":"382661_CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","volume":"2","author":"R. A. Kowalski","year":"1971","unstructured":"Kowalski, R. A. and Kuehner, D.: Linear resolution with selection functions, Artificial Intelligence2 (1971), 227-260.","journal-title":"Artificial Intelligence"},{"key":"382661_CR13","unstructured":"Kowalski, R. A.: Predicate logic as a programming language, in IFIP 74, pp. 569-574."},{"issue":"3","key":"382661_CR14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(98)10027-4","volume":"38","author":"J. Y. Liu","year":"1999","unstructured":"Liu, J. Y., Adams, L. and Chen, W.: Constructive negation under the well-founded semantics, J. Logic Programming38(3) (1999), 295-330.","journal-title":"J. Logic Programming"},{"key":"382661_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"Lloyd, J. W.: Foundations of Logic Programming, 2nd edn, Springer-Verlag, Berlin, 1987.","edition":"2nd edn"},{"key":"382661_CR16","volume-title":"Logic Programming and Prolog","author":"U. Nilsson","year":"1995","unstructured":"Nilsson, U. and Maluszynski, J.: Logic Programming and Prolog, 2nd edn, Wiley, New York, 1995.","edition":"2nd edn"},{"key":"382661_CR17","first-page":"167","volume":"5","author":"T. Przymusunski","year":"1989","unstructured":"Przymusunski, T.: On the declarative and procedural semantics of logic programs, J. Automated Reasoning5 (1989), 167-205.","journal-title":"J. Automated Reasoning"},{"key":"382661_CR18","doi-asserted-by":"crossref","unstructured":"Przymusunski, T.: Every logic program has a natural stratification and an iterated fixed point model, in Proc. of the 8th ACM Symposium on Principles of Database Systems, 1989, pp. 11-21.","DOI":"10.1145\/73721.73723"},{"key":"382661_CR19","unstructured":"Przymusunski, T.: On constructive negation in logic programming, in E. L. Lusk and R. A. Overbeek (eds.), Proc. of the North American Conference on Logic Programming, MIT Press, Cambridge, Mass., 1989, Addendum to the volume."},{"key":"382661_CR20","first-page":"445","volume":"13","author":"T. Przymusunski","year":"1990","unstructured":"Przymusunski, T.: The well-founded semantics coincides with the three-valued stable semantics, Fund. Inform.13 (1990), 445-463.","journal-title":"Fund. Inform."},{"issue":"1","key":"382661_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"Robinson, J. A.: A machine-oriented logic based on the resolution principle, J. ACM12(1) (1965), 23-41.","journal-title":"J. ACM"},{"issue":"1","key":"382661_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(92)90019-Y","volume":"13","author":"K. Ross","year":"1992","unstructured":"Ross, K.: A procedural semantics for well-founded negation in logic programs, J. Logic Programming13(1) (1992), 1-22.","journal-title":"J. Logic Programming"},{"key":"382661_CR23","doi-asserted-by":"crossref","unstructured":"Sagonas, K., Swift, T. and Warren, D. S.: XSB as an efficient deductive database engine, in Proc. of the ACM SIGMOD Conference on Management of Data, Minneapolis, 1994, pp. 442-453.","DOI":"10.1145\/191839.191927"},{"key":"382661_CR24","doi-asserted-by":"crossref","unstructured":"Sagonas, K. and Swift, T.: An abstract machine for tabled execution of fixed-order stratified logic programs, ACM Trans. Programming Languages and Systems20(3) (1998).","DOI":"10.1145\/291889.291897"},{"key":"382661_CR25","unstructured":"Sagonas, K., Swift, T., Warren, D. S., Freire, J. and Rao, P.: The XSB Programmer's Manual (Version 1.8), 1998."},{"issue":"2","key":"382661_CR26","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF03037237","volume":"15","author":"Y. D. Shen","year":"1997","unstructured":"Shen, Y. D.: An extended variant of atoms loop check for positive logic programs, New Generation Comput.15(2) (1997), 187-204.","journal-title":"New Generation Comput."},{"issue":"1","key":"382661_CR27","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1017\/S1471068400001010","volume":"1","author":"Y. D. Shen","year":"2001","unstructured":"Shen, Y. D., Yuan, L. Y., You, J. H. and Zhou, N. F.: Linear tabulated resolution based on Prolog control strategy, Theory and Practice of Logic Programming(previously J. Logic Programming) 1(1) (2001), 71-103.","journal-title":"Theory and Practice of Logic Programming (previously J. Logic Programming)"},{"key":"382661_CR28","doi-asserted-by":"crossref","unstructured":"Shen, Y. D., Yuan, L. Y., You, J. H. and Zhou, N. F.: Linear tabulated resolution for the well founded semantics, in Proc. of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, Texas, 1999, pp. 192-205.","DOI":"10.1007\/3-540-46767-X_14"},{"key":"382661_CR29","doi-asserted-by":"crossref","unstructured":"Shepherdson, J. C.: Negation in logic programming, in J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 1988, pp. 19-88.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"382661_CR30","doi-asserted-by":"crossref","unstructured":"Tamaki, H. and Sato, T.: OLD resolution with tabulation, in Proc. of the Third International Conference on Logic Programming, London, 1986, pp. 84-98.","DOI":"10.1007\/3-540-16492-8_66"},{"issue":"4","key":"382661_CR31","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. H. Van Emden","year":"1976","unstructured":"Van Emden, M. H. and Kowalski, R. A.: The semantics of predicate logic as a programming language, J. ACM23(4) (1976), 733-742.","journal-title":"J. ACM"},{"issue":"1","key":"382661_CR32","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0743-1066(89)90032-0","volume":"6","author":"A. Van Gelder","year":"1989","unstructured":"Van Gelder, A.: Negation as failure using tight derivations for general logic programs, J. Logic Programming6 (1&2) (1989), 109-133.","journal-title":"J. Logic Programming"},{"issue":"3","key":"382661_CR33","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K. and Schlipf, J.: The well-founded semantics for general logic programs, J. ACM38(3) (1991), 620-650.","journal-title":"J. ACM"},{"key":"382661_CR34","doi-asserted-by":"crossref","unstructured":"Vardi, M.: The complexity of relational query languages, in ACM Symposium on Theory of Computing, 1982, pp. 137-146.","DOI":"10.1145\/800070.802186"},{"key":"382661_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vieille","year":"1989","unstructured":"Vieille, L.: Recursive query processing: The power of logic, Theoret. Comput. Sci.69 (1989), 1-53.","journal-title":"Theoret. Comput. Sci."},{"key":"382661_CR36","unstructured":"Warren, D. H. D.: An abstract Prolog instruction set, Technical Report 309, SRI International, 1983."},{"issue":"3","key":"382661_CR37","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/131295.131299","volume":"35","author":"D. S. Warren","year":"1992","unstructured":"Warren, D. S.: Memoing for logic programs, CACM35(3) (1992), 93-111.","journal-title":"CACM"},{"issue":"6","key":"382661_CR38","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1145\/236114.236120","volume":"18","author":"N. F. Zhou","year":"1996","unstructured":"Zhou, N. F.: Parameter passing and control stack management in Prolog implementation revisited, ACM Trans. Programming Languages and Systems18(6) (1996), 752-779.","journal-title":"ACM Trans. Programming Languages and Systems"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020116927466.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020116927466\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020116927466.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:30:31Z","timestamp":1749123031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020116927466"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["382661"],"URL":"https:\/\/doi.org\/10.1023\/a:1020116927466","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}