{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:06:00Z","timestamp":1794337560369,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540618140","type":"print"},{"value":"9783540706830","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0031750","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:44:07Z","timestamp":1134265447000},"page":"343-363","source":"Crossref","is-referenced-by-count":4,"title":["The limits of fixed-order computation"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Sagonas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Terrance","family":"Swift","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David S.","family":"Warren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","volume":"78","author":"N. Bidoit","year":"1991","unstructured":"N. Bidoit and C. Froidevaux. Negation by default and unstratifiable logic programs. Theoretical Comput. Sci., 78(1):85\u2013112, January 1991.","journal-title":"Theoretical Comput. Sci."},{"key":"17_CR2","first-page":"199","volume-title":"Tabulated resolution for well founded semantics","author":"R. Bol","year":"1993","unstructured":"R. Bol and L. Degerstedt. Tabulated resolution for well founded semantics. In D. Miller, editor, Proceedings of the 1993 International Symposium on Logic Programming, pages 199\u2013219, Vancouver, October 1993. The MIT Press."},{"issue":"1","key":"17_CR3","doi-asserted-by":"crossref","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):20\u201374, January 1996.","journal-title":"J. ACM"},{"key":"17_CR4","first-page":"166","volume-title":"Classifying semantics of logic programs","author":"J. Dix","year":"1991","unstructured":"J. Dix. Classifying semantics of logic programs. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and Mon-Monotonic Reasoning, Proceedings of the first International Workshop, pages 166\u2013180, Washington D.C., July 1991. The MIT Press."},{"key":"17_CR5","first-page":"1081","volume-title":"The stable model semantics for logic programming","author":"M. Gelfond","year":"1988","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1081\u20131086, Seattle, August 1988. The MIT Press."},{"issue":"3","key":"17_CR6","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1006\/jcss.1996.0038","volume":"52","author":"S. Morishita","year":"1996","unstructured":"S. Morishita. An Extension of Van Gelder's Alternating Fixpoint to Magic Programs. J. Comput. Syst. Sci., 52(3):506\u2013521, June 1996.","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"17_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/FI-1990-13106","volume":"13","author":"H. Przymusinska","year":"1990","unstructured":"H. Przymusinska and T. C. Przymusinski. Weakly Stratified Logic Programs. Fundamenta Informaticae, 13(1):51\u201365, March 1990.","journal-title":"Fundamenta Informaticae"},{"key":"17_CR8","first-page":"11","volume-title":"Every Logic Program has a Natural Stratification and an Iterated Least Fixed Point Model","author":"T. C. Przymusinski","year":"1989","unstructured":"T. C. Przymusinski. Every Logic Program has a Natural Stratification and an Iterated Least Fixed Point Model. In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, pages 11\u201321, Philadelphia, Pennsylvania, March 1989. ACM."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01530784","volume":"12","author":"T. C. Przymusinski","year":"1994","unstructured":"T. C. Przymusinski. Well-Founded and Stationary Models of Logic Programs. Annals of Mathematics and Artificial Intelligence, 12:141\u2013187, 1994.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"17_CR10","first-page":"273","volume-title":"Controlling the search in bottom-up evaluation","author":"R. Ramakrishnan","year":"1992","unstructured":"R. Ramakrishnan, D. Srivastava, and S. Sudarshan. Controlling the search in bottom-up evaluation. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 273\u2013287, Washington D.C., October 1992. The MIT Press."},{"key":"17_CR11","unstructured":"R. Ramakrishnan, D. Srivastava, and S. Sudarshan. CORAL \u2014 Control, Relations, and Logic. In Proceedings of the 18th Conference on Very Large Data Bases, pages 238\u2013249, Vancouver, Canada, August 1992."},{"issue":"1","key":"17_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(92)90019-Y","volume":"13","author":"K. A. Ross","year":"1992","unstructured":"K. A. Ross. A procedural semantics for well-founded negation in logic programs. Journal of Logic Programming, 13(1):1\u201322, May 1992.","journal-title":"Journal of Logic Programming"},{"issue":"6","key":"17_CR13","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1145\/195613.195646","volume":"41","author":"K. A. Ross","year":"1994","unstructured":"K. A. Ross. Modular Stratification and Magic Sets for Datalog programs with Negation. J. ACM, 41(6):1216\u20131266, November 1994.","journal-title":"J. ACM"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"K. Sagonas, T. Swift, and D. S. Warren. XSB as an Efficient Deductive Database Engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 442\u2013453, Minneapolis, Minnesota, May 1994.","DOI":"10.1145\/191839.191927"},{"key":"17_CR15","volume-title":"LNAI","author":"K. Sagonas","year":"1996","unstructured":"K. Sagonas, T. Swift, and D. S. Warren. An Abstract Machine for Fixed-Order Dynamically Stratified Programs. In Proceedings of the Thirteenth International Conference on Automated Deduction, LNAI, New Brunswick, New Jersey, July 1996. Springer-Verlag. To appear."},{"key":"17_CR16","first-page":"161","volume-title":"number 761 in LNCS","author":"P. J. Stuckey","year":"1993","unstructured":"P. J. Stuckey and S. Sudarshan. Well-Founded Ordered Search. In R. Shyamasundar, editor, Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, number 761 in LNCS, pages 161\u2013171, Bombay, India, December 1993. Springer-Verlag."},{"key":"17_CR17","first-page":"633","volume-title":"An abstract machine for SLG resolution: Definite Programs","author":"T. Swift","year":"1994","unstructured":"T. Swift and D. S. Warren. An abstract machine for SLG resolution: Definite Programs. In M. Bruynooghe, editor, Proceedings of the 1994 International Symposium on Logic Programming, pages 633\u2013652, Ithaca, November 1994. The MIT Press."},{"key":"17_CR18","first-page":"1","volume-title":"The Alternating Fixpoint of Logic Programs with Negation","author":"A. Gelder Van","year":"1989","unstructured":"A. Van Gelder. The Alternating Fixpoint of Logic Programs with Negation. In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, pages 1\u201310, Philadelphia, Pennsylvania, March 1989. ACM."},{"issue":"3","key":"17_CR19","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"A. Van Gelder, K. A. Ross, and J. S. Schlipf. The Well-Founded Semantics for General Logic Programs. J. ACM, 38(3):620\u2013650, July 1991.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Logic in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T03:33:44Z","timestamp":1626838424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618140","9783540706830"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0031750","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0031733","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}