{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:03Z","timestamp":1761611103858,"version":"3.40.5"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"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":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1018990308362","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"201-240","source":"Crossref","is-referenced-by-count":43,"title":["Tabling for non\u2010monotonic programming"],"prefix":"10.1007","volume":"25","author":[{"given":"Terrance","family":"Swift","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"325530_CR1","unstructured":"S. Adah and V.S. Subrahmanian, Amalgamating knowledge bases, II: Algorithms, data structures and query processing, J. Logic Programming (1996)."},{"issue":"1","key":"325530_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF00883931","volume":"14","author":"J. Alferes","year":"1995","unstructured":"J. Alferes, C. Dam\u00e1sio and L.M. Pereira, A logic programming system for non-monotonic reasoning, J. Automated Reasoning 14(1) (1995) 93-147.","journal-title":"J. Automated Reasoning"},{"key":"325530_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-61488-5","volume-title":"Reasoning with Logic Programming","author":"J. Alferes","year":"1996","unstructured":"J. Alferes and L.M. Pereira, Reasoning with Logic Programming, Lecture Notes in Artificial Intelligence, Vol. 1111 (Springer, Berlin, 1996)."},{"key":"325530_CR4","unstructured":"J. Alferes, L.M. Pereira and T. Swift, Well-founded abduction via tabling dual programs, Technical Report, SUNY Stony Brook (1999, in preparation)."},{"key":"325530_CR5","volume-title":"Normal forms for defeasible logic","author":"G. Antoniou","year":"1998","unstructured":"G. Antoniou, D. Billington and M. Maher, Normal forms for defeasible logic, in: International Conference on Logic Programming (MIT Press, Cambridge, MA, 1998)."},{"key":"325530_CR6","first-page":"813","volume-title":"Propositional semantics for disjunctive logic programs","author":"R. Ben-Eliahu","year":"1992","unstructured":"R. Ben-Eliahu and R. Dechter, Propositional semantics for disjunctive logic programs, in: Joint International Conference\/Symposium on Logic Programming (MIT Press, Cambridge, MA, 1992) pp. 813-127."},{"key":"325530_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(89)90126-6","volume":"68","author":"H. Blair","year":"1989","unstructured":"H. Blair and V.S. Subrahmanian, Paraconsistent logic programming, Theoret. Comput. Sci. 68 (1989) 135-154.","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"325530_CR8","first-page":"31","volume":"38","author":"R. Bol","year":"1998","unstructured":"R. Bol and L. Degerstedt, Tabulated resolution for well-founded semantics, J. Logic Programming 38(1) (1998) 31-55.","journal-title":"J. Logic Programming"},{"key":"325530_CR9","unstructured":"D. Boulanger, Fine-grained goal-directed declarative analysis of logic programs, in: Proceedings of the International Workshop on Verification, Model Checking and Abstract Interpretation (1997). Available through http:\/\/www.dsi.unive.it\/~bossi\/VMCAI.html."},{"issue":"1","key":"325530_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"W. Chen and D.S. Warren, Tabled evaluation with delaying for general logic programs, J. ACM 43(1) (1996) 20-74.","journal-title":"J. ACM"},{"key":"325530_CR11","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. Parrow and B. Steffen, The concurrency workbench: A semantics-based tool for the verification of concurrent systems, ACM Trans. Programming Languages and Systems (1993) 36-73.","DOI":"10.1145\/151646.151648"},{"issue":"1","key":"325530_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s100090050016","volume":"2","author":"M. Codish","year":"1998","unstructured":"M. Codish, B. Demoen and K. Sagonas, Semantics-based program analysis for logic-based languages using XSB, Springer Internat. J. Software Tools Technology Transfer 2(1) (1998) 29-45.","journal-title":"J. Software Tools Technology Transfer"},{"key":"325530_CR13","unstructured":"C. Crowner, K. Govindarajan, B. Jayaraman and S. Mantha, Preference logic grammars, Computer Languages (1999, to appear)."},{"key":"325530_CR14","first-page":"1","volume-title":"PLILP '98","author":"B. Cui","year":"1998","unstructured":"B. Cui, Y. Dong, X. Du, K. Kumar, C.R. Ramakrishnan, I.V. Ramakrishnan, A. Roychoudhury, S. Smolka and D.S. Warren, Logic programming and model checking, in: PLILP '98 (Springer, Berlin, 1998) pp. 1-20."},{"key":"325530_CR15","unstructured":"B. Cui, T. Swift and D.S. Warren, Using tabled logic programs and preference logic for data standardization, available at http:\/\/www.cs.sunysb.edu\/~tswift (1998)."},{"key":"325530_CR16","unstructured":"C. Dam\u00e1sio, Paraconsistent extended logic programming with constraints, Ph.D. thesis, University Nova de Lisboa (1996)."},{"key":"325530_CR17","first-page":"194","volume-title":"Optimizing clause resolution: Beyond unification factoring","author":"S. Dawson","year":"1995","unstructured":"S. Dawson, C.R. Ramakrishnan, I.V. Ramakrishnan and T. Swift, Optimizing clause resolution: Beyond unification factoring, in: International Logic Programming Symposium (MIT Press, Cambridge, MA, 1995) pp. 194-208."},{"key":"325530_CR18","doi-asserted-by":"crossref","unstructured":"S. Dawson, C.R. Ramakrishnan and D.S. Warren, Practical program analysis using general purpose logic programming systems \u2014 a case study, in: ACM PLDI (May 1996) pp. 117-126.","DOI":"10.1145\/231379.231399"},{"key":"325530_CR19","first-page":"391","volume-title":"Hybrid probabilistic programs","author":"A. Dekhtyar","year":"1997","unstructured":"A. Dekhtyar and V.S. Subrahmanian, Hybrid probabilistic programs, in: International Conference on Logic Programming (MIT Press, Cambridge, MA, 1997) pp. 391-407."},{"key":"325530_CR20","volume-title":"Fundamentals of Contemporary Set Theory","author":"K. Devlin","year":"1980","unstructured":"K. Devlin, Fundamentals of Contemporary Set Theory (Springer, Berlin, 1980)."},{"key":"325530_CR21","unstructured":"Diagnostic and Statistical Manual of Mental Disorders, 4th ed. (American Psychiatric Association, Washington, DC, 1994). Prepared by the Task Force on DSM-IV and other committees and work groups of the American Psychiatric Association."},{"key":"325530_CR22","unstructured":"Diagnostica, Available from Medicine Rules Inc: http:\/\/medicinerules.com."},{"key":"325530_CR23","unstructured":"E.A. Emerson and C.L. Lei, Efficient model checking in fragments of the propositional mu-calculus, in: Proceedings of the 1st Annual Conference on Logic in Computer Science (IEEE, 1986) pp. 267-278."},{"key":"325530_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)90014-G","volume":"11","author":"M. Fitting","year":"1991","unstructured":"M. Fitting, Bilattices and the semantics of logic programming, J. Logic Programming 11 (1991) 91-116.","journal-title":"J. Logic Programming"},{"key":"325530_CR25","doi-asserted-by":"crossref","unstructured":"J. Freire, T. Swift and D.S. Warren, Treating I\/O seriously: Resolution reconsidered for disk, in: International Conference on Logic Programming (1997) pp. 198-212.","DOI":"10.7551\/mitpress\/4299.003.0020"},{"key":"325530_CR26","unstructured":"J. Freire, T. Swift and D.S. Warren, Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies, J. Functional Logic Programming 1998(3) (1998)."},{"key":"325530_CR27","first-page":"1070","volume-title":"The stable model semantics for logic programming","author":"M. Gelfond","year":"1988","unstructured":"M. Gelfond and V. Lifshitz, The stable model semantics for logic programming, in: Joint International Conference\/Symposium on Logic Programming (MIT Press, Cambridge, MA, 1988) pp. 1070-1080."},{"key":"325530_CR28","first-page":"579","volume-title":"Logic programs with classical negation","author":"M. Gelfond","year":"1990","unstructured":"M. Gelfond and V. Lifshitz, Logic programs with classical negation, in: International Conference on Logic Programming (MIT Press, Cambridge, MA, 1990) pp. 579-597."},{"key":"325530_CR29","doi-asserted-by":"crossref","first-page":"731","DOI":"10.7551\/mitpress\/4298.003.0070","volume-title":"Preference logic programming","author":"K. Govindarajan","year":"1995","unstructured":"K. Govindarajan, B. Jayaraman and S. Mantha, Preference logic programming, in: International Conference on Logic Programming (MIT Press, Cambridge, MA, 1995) pp. 731-746."},{"key":"325530_CR30","unstructured":"ISO working group JTC1\/SC22, Prolog international standard, Technical Report, International Standards Organization (1995)."},{"key":"325530_CR31","unstructured":"C. Jonker, Constraints and negations in logic programs, Ph.D. thesis, Utrecht University (1994)."},{"issue":"4","key":"325530_CR32","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0743-1066(92)90007-P","volume":"12","author":"M. Kifer","year":"1992","unstructured":"M. Kifer and V.S. Subrahmanian, Theory of generalized annotated logic programming and its applications, J. Logic Programming 12(4) (1992) 335-368.","journal-title":"J. Logic Programming"},{"key":"325530_CR33","unstructured":"E. Lamma, F. Riguzzi and L.M. Pereira, Strategies in learning with extended logic programs, Technical Report, Universita di Bologna (1998)."},{"key":"325530_CR34","volume-title":"Syntactica, Symantica","author":"R. Larson","year":"1995","unstructured":"R. Larson, D.S. Warren, J. Freire and K. Sagonas, Syntactica, Symantica (MIT Press, Cambridge, MA, 1995)."},{"key":"325530_CR35","first-page":"257","volume-title":"Computing annotated logic programs","author":"S. Leach","year":"1994","unstructured":"S. Leach and J. Lu, Computing annotated logic programs, in: International Conference on Logic Programming (MIT Press, Cambridge, MA, 1994) pp. 257-271."},{"key":"325530_CR36","first-page":"265","volume-title":"Iterated logic programming updates","author":"J. Leite","year":"1998","unstructured":"J. Leite and L.M. Pereira, Iterated logic programming updates, in: International Conference on Logic Programming (MIT Press, Cambridge, MA, 1998) pp. 265-278."},{"key":"325530_CR37","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1023\/A:1018921603877","volume":"21","author":"R. Li","year":"1997","unstructured":"R. Li and L.M. Pereira, Representing and reasoning about actions with abductive logic programming, Ann. Math. Artif. Intell. 21 (1997) 245-303.","journal-title":"Ann. Math. Artif. Intell."},{"key":"325530_CR38","first-page":"5","volume-title":"TACAS 98: Tools and Algorithms for Construction and Analysis of Systems","author":"X. Liu","year":"1998","unstructured":"X. Liu, C.R. Ramakrishnan and S. Smolka, Fully local and efficient evaluation of alternating fixed points, in: TACAS 98: Tools and Algorithms for Construction and Analysis of Systems (Springer, Berlin, 1998) pp. 5-19."},{"key":"325530_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1984","unstructured":"J. W. Lloyd, Foundations of Logic Programming (Springer, Berlin, 1984)."},{"key":"325530_CR40","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner, Communication and Concurrency (Prentice-Hall, New York, 1989)."},{"key":"325530_CR41","first-page":"420","volume-title":"Smodels \u2014 An implementation of the stable model and well-founded semantics for normal LP","author":"I. Niemel\u00e4","year":"1997","unstructured":"I. Niemel\u00e4 and P. Simons, Smodels \u2014 An implementation of the stable model and well-founded semantics for normal LP, in: International Workshop on Logic Programming and Non-Monotonic Reasoning (Springer, Berlin, 1997) pp. 420-429."},{"key":"325530_CR42","first-page":"11","volume-title":"ACM Principles of Database Systems","author":"T. Przymusinski","year":"1989","unstructured":"T. Przymusinski, Every logic program has a natural stratification and an iterated least fixed point model, in: ACM Principles of Database Systems (ACM Press, Cambridge, MA, 1989) pp. 11-21."},{"key":"325530_CR43","doi-asserted-by":"crossref","unstructured":"Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S. Smolka, T. Swift and D.S. Warren, Efficient model checking using tabled resolution, in: Proceedings on the Conference on Automated Verification (1997) pp. 143-154.","DOI":"10.1007\/3-540-63166-6_16"},{"issue":"1","key":"325530_CR44","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0743-1066(98)10013-4","volume":"38","author":"I.V. Ramakrishnan","year":"1999","unstructured":"I.V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift and D.S. Warren, Efficient access mechanisms for tabled logic programs, J. Logic Programming 38(1) (1999) 31-55.","journal-title":"J. Logic Programming"},{"key":"325530_CR45","unstructured":"I.V. Ramakrishnan, A. Roychoudhury and T. Swift, A standardization tool for data warehousing, in: Practical Applications of Prolog (1997)."},{"issue":"3","key":"325530_CR46","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1145\/291889.291897","volume":"20","author":"K. Sagonas","year":"1998","unstructured":"K. Sagonas and T. Swift, An abstract machine for tabled execution of fixed-order stratified logic programs, ACM TOPLAS 20(3) (1998) 586-635.","journal-title":"ACM TOPLAS"},{"key":"325530_CR47","first-page":"274","volume-title":"An abstract machine for computing the well-founded semantics. Extended version of article","author":"K. Sagonas","year":"1996","unstructured":"K. Sagonas, T. Swift and D.S. Warren, An abstract machine for computing the well-founded semantics. Extended version of article, in: Joint International Conference and Symposium on Logic Programming (MIT Press, Cambridge, MA, 1996) pp. 274-289."},{"key":"325530_CR48","unstructured":"K. Sagonas, T. Swift and D.S. Warren, The limits of fixed-order computation, Theoret. Comput. Sci. (1999, to appear)."},{"key":"325530_CR49","unstructured":"K. Sagonas, T. Swift, D.S. Warren, J. Freire and P. Rao, The XSB Programmer's Manual: Version 1.9 (1998)."},{"key":"325530_CR50","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5739-5","volume-title":"Autonomous, Model-Based Diagnosis Agents","author":"M. Schroeder","year":"1998","unstructured":"M. Schroeder, Autonomous, Model-Based Diagnosis Agents (Kluwer Academic, Dordrecht, 1998)."},{"key":"325530_CR51","doi-asserted-by":"crossref","unstructured":"S. Smolka, O. Sokolsky and S. Zhang, Model checking in the modal \u03bc-calculus, in: IEEE Symposium on Logic in Computer Science (1994).","DOI":"10.1007\/3-540-58179-0_67"},{"issue":"2","key":"325530_CR52","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/176567.176571","volume":"19","author":"V.S. Subrahmanian","year":"1994","unstructured":"V.S. Subrahmanian, Amalgamating knowledge bases, ACM Trans. Database Systems 19(2) (1994) 291-331.","journal-title":"ACM Trans. Database Systems"},{"key":"325530_CR53","unstructured":"T. Swift, A new formulation of tabled resolution with delay, submitted for publication; available at http:\/\/www.cs.sunysb.edu\/~tswift."},{"key":"325530_CR54","unstructured":"T. Swift, C. Henderson, R. Holberger, J. Murphey and E. Neham, CCTIS: An expert transaction processing system, in: 6th Conference on Industrial Applications of Artificial Intelligence (1994) pp. 131-140."},{"key":"325530_CR55","first-page":"84","volume-title":"OLDT resolution with tabulation","author":"H. Tamaki","year":"1986","unstructured":"H. Tamaki and T. Sato, OLDT resolution with tabulation, in: International Conference on Logic Programming (Springer, Berlin, 1986) pp. 84-98."},{"key":"325530_CR56","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0743-1066(86)90003-8","volume":"4","author":"M. van Emden","year":"1986","unstructured":"M. van Emden, Quantitative deduction and its fixpoint theory, J. Logic Programming 4 (1986) 37-53.","journal-title":"J. Logic Programming"},{"issue":"3","key":"325530_CR57","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. van Gelder","year":"1991","unstructured":"A. van Gelder, K. Ross and J. Schlipf, Unfounded sets and well-founded semantics for general logic programs, J. ACM 38(3) (1991) 620-650.","journal-title":"J. ACM"},{"key":"325530_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vieille","year":"1989","unstructured":"L. Vieille, Recursive query processing: The power of logic, Theoret. Comput. Sci. 69 (1989) 1-53.","journal-title":"Theoret. Comput. Sci."},{"key":"325530_CR59","first-page":"300","volume-title":"Reasoning with inconsistency in extended deductive databases","author":"G. Wagner","year":"1994","unstructured":"G. Wagner, Reasoning with inconsistency in extended deductive databases, in: International Workshop on Logic Programming and Non-Monotonic Reasoning (MIT Press, Cambridge, MA, 1994) pp. 300-315."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018990308362.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018990308362\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018990308362.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:45:03Z","timestamp":1747547103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018990308362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":59,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["325530"],"URL":"https:\/\/doi.org\/10.1023\/a:1018990308362","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}