{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T07:29:38Z","timestamp":1672385378711},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00341-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:01:38Z","timestamp":1027627298000},"page":"465-499","source":"Crossref","is-referenced-by-count":5,"title":["The limits of fixed-order computation"],"prefix":"10.1016","volume":"254","author":[{"given":"Konstantinos","family":"Sagonas","sequence":"first","affiliation":[]},{"given":"Terrance","family":"Swift","sequence":"additional","affiliation":[]},{"given":"David","family":"S. Warren","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(99)00341-2_BIB1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00883931","article-title":"A logic programming system for non-monotonic reasoning","volume":"14","author":"Alferes","year":"1995","journal-title":"J. Automat. Reasoning"},{"issue":"1","key":"10.1016\/S0304-3975(99)00341-2_BIB2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","article-title":"Negation by default and unstratifiable logic programs","volume":"78","author":"Bidoit","year":"1991","journal-title":"Theoret. Comput. Sci."},{"issue":"42","key":"10.1016\/S0304-3975(99)00341-2_BIB3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0743-1066(97)00073-3","article-title":"Tabulated resolution for the well founded semantics","volume":"3","author":"Bol","year":"1998","journal-title":"J. Logic Programming"},{"issue":"3","key":"10.1016\/S0304-3975(99)00341-2_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0743-1066(93)90039-J","article-title":"HiLog","volume":"15","author":"Chen","year":"1993","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/S0304-3975(99)00341-2_BIB5","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/227595.227597","article-title":"Tabled evaluation with delaying for general logic programs","volume":"43","author":"Chen","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00341-2_BIB6","unstructured":"J. Dix, Classifying semantics of logic programs, in: A. Nerode, W. Marek, V.S. Subrahmanian (Eds.), Logic Programming and Mon-Monotonic Reasoning, Proc. 1st Internat. Workshop, The MIT Press, Washington D.C., July 1991, pp. 166\u2013180."},{"key":"10.1016\/S0304-3975(99)00341-2_BIB7","unstructured":"E.A. Emerson, C.-L. Lei, Efficient model checking in fragments of the propositional mu-calculus, in: Proc. IEEE Symp. on Logic in Computer Science, IEEE Computer Society, Cambridge, MA, June 1986, pp. 267\u2013278."},{"key":"10.1016\/S0304-3975(99)00341-2_BIB8","unstructured":"J. Freire, T. Swift, D.S. Warren, Beyond depth-first strategies: Improving tabled logic programs through alternative scheduling, J. Funct. Logic Programming 1998(3) (1998)."},{"key":"10.1016\/S0304-3975(99)00341-2_BIB9","unstructured":"M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: R.A. Kowalski, K.A. Bowen (Eds.), Proc. 5th Internat. Conf. and Symp. on Logic Programming, The MIT Press, Seattle, August 1988, pp. 1081\u20131086."},{"key":"10.1016\/S0304-3975(99)00341-2_BIB10","doi-asserted-by":"crossref","unstructured":"X. Liu, C.R. Ramakrishnan, S.A. Smolka, Fully local and efficient evaluation of alternating fixed points, in: B. Steffen (Ed.), Proc. TACAS-98: Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, Vol. 1384, Springer, Lisbon, Portugal, March\/April 1998, pp. 5\u201319.","DOI":"10.1007\/BFb0054161"},{"key":"10.1016\/S0304-3975(99)00341-2_BIB11","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0304-3975(99)00341-2_BIB12","unstructured":"Medicine Rules, Inc. Diagnostica, Technical Report, 1998. http:\/\/medicinerules.com."},{"issue":"3","key":"10.1016\/S0304-3975(99)00341-2_BIB13","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1006\/jcss.1996.0038","article-title":"An extension of Van Gelder's alternating fixpoint to magic programs","volume":"52","author":"Morishita","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00341-2_BIB14","unstructured":"I. Niemel\u00e4, P. Simons, Smodels \u2013 an implementation of the stable model and well-founded semantics for normal LP, in: J. Dix, U. Furbach, A. Nerode (Eds.), Proc. 4th Internat. Conf. on Logic Programming and Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence, Vol. 1265, Springer, Dagstuhl Castle, Germany, July 1997, pp. 420\u2013429."},{"issue":"1","key":"10.1016\/S0304-3975(99)00341-2_BIB15","first-page":"51","article-title":"Weakly stratified logic programs","volume":"13","author":"Przymusinska","year":"1990","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(99)00341-2_BIB16","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the declarative semantics of deductive databases and logic programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/S0304-3975(99)00341-2_BIB17","doi-asserted-by":"crossref","unstructured":"T.C. Przymusinski, Every logic program has a natural stratification and an iterated least fixed point model, in: Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, ACM Press, Philadelphia, Pennsylvania, March 1989, pp. 11\u201321.","DOI":"10.1145\/73721.73723"},{"key":"10.1016\/S0304-3975(99)00341-2_BIB18","doi-asserted-by":"crossref","unstructured":"Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, T. Swift, D.S. Warren, Efficient model checking using tabled resolution, in: O. Grumberg (Ed.), Proc. 9th Internat. Conf. on Computer-Aided Verification, Lecture Notes in Computer Science, Vol. 1254, Springer, Haifa, Israel, July 1997, pp. 143\u2013154.","DOI":"10.1007\/3-540-63166-6_16"},{"issue":"1","key":"10.1016\/S0304-3975(99)00341-2_BIB19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0743-1066(98)10013-4","article-title":"Efficient access mechanisms for tabled logic programs","volume":"38","author":"Ramakrishnan","year":"1999","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(99)00341-2_BIB20","doi-asserted-by":"crossref","unstructured":"R. Ramakrishnan, D. Srivastava, S. Sudarshan, Controlling the search in bottom-up evaluation, in: K. Apt (Ed.), Proc. Joint Internat. Conf. and Symposium on Logic Programming, The MIT Press, Washington DC, October 1992, pp. 273\u2013287.","DOI":"10.1007\/978-1-4615-3506-5_11"},{"key":"10.1016\/S0304-3975(99)00341-2_BIB21","unstructured":"R. Ramakrishnan, D. Srivastava, S. Sudarshan, CORAL \u2013 control, relations, and logic, in: Proc. 18th Conf. on Very Large Data Bases, Morgan-Kaufmann, Vancouver, Canada, August 1992, pp. 238\u2013249."},{"key":"10.1016\/S0304-3975(99)00341-2_BIB22","unstructured":"P. Rao, K. Sagonas, T. Swift, D.S. Warren, J. Freire, XSB: a system for efficiently computing WFS, in: J. Dix, U. Furbach, A. Nerode (Eds.), Proc. 4th Internat. Conf. on Logic Programming and Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence, Vol. 1265, Springer, Dagstuhl Castle, Germany, July 1997, pp. 430\u2013440."},{"issue":"1","key":"10.1016\/S0304-3975(99)00341-2_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(92)90019-Y","article-title":"A procedural semantics for well-founded negation in logic programs","volume":"13","author":"Ross","year":"1992","journal-title":"J. Logic Programming"},{"issue":"6","key":"10.1016\/S0304-3975(99)00341-2_BIB24","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1145\/195613.195646","article-title":"Modular stratification and magic sets for Datalog programs with negation","volume":"41","author":"Ross","year":"1994","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0304-3975(99)00341-2_BIB25","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1145\/291889.291897","article-title":"An abstract machine for tabled execution of fixed-order stratified logic programs","volume":"20","author":"Sagonas","year":"1998","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(99)00341-2_BIB26","unstructured":"K. Sagonas, T. Swift, D.S. Warren, An abstract machine for computing the well-founded semantics, in: M. Maher (Ed.), Proc. Joint Internat. Conf. and Symp. on Logic Programming, The MIT Press, Bonn, Germany, September 1996, pp. 274\u2013288."},{"issue":"3","key":"10.1016\/S0304-3975(99)00341-2_BIB27","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0743-1066(96)00110-0","article-title":"Well-founded ordered search: goal-directed bottom-up evaluation of well-founded models","volume":"32","author":"Stuckey","year":"1997","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/S0304-3975(99)00341-2_BIB28","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(93)90024-Q","article-title":"The alternating fixpoint of logic programs with negation","volume":"47","author":"Van Gelder","year":"1993","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0304-3975(99)00341-2_BIB29","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003412?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003412?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T22:33:02Z","timestamp":1579127582000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599003412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599003412"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00341-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}