{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T01:01:44Z","timestamp":1768438904194,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1991,8]]},"DOI":"10.1007\/bf03037168","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T02:52:58Z","timestamp":1240368778000},"page":"335-363","source":"Crossref","is-referenced-by-count":90,"title":["Acyclic programs"],"prefix":"10.1007","volume":"9","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Bezem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037168_CR1","first-page":"493","volume-title":"Handbook of Theoretical Computer Science, Vol. B","author":"K. R. Apt","year":"1990","unstructured":"Apt, K. R., \u201cLogic Programming,\u201d inHandbook of Theoretical Computer Science, Vol. B (J. van Leeuwen, ed.), Elsevier, Amsterdam, pp. 493\u2013574, 1990."},{"key":"BF03037168_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1990-13103","volume":"13","author":"K. R. Apt","year":"1990","unstructured":"Apt, K. R. and Blair, H. A., \u201cArithmetic Classification of Perfect Models of Stratified Programs,\u201dFundamenta Informaticae, 13, pp. 1\u201318, 1990 (with an addendum in vol. 14, pp. 339\u2013343, 1991).","journal-title":"Fundamenta Informaticae"},{"key":"BF03037168_CR3","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. A. and Walker, A, \u201cTowards a Theory of Declarative Knowledge,\u201d inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann, Los Altos, pp. 89\u2013148, 1988."},{"key":"BF03037168_CR4","unstructured":"Bezem, M., \u201cCharacterizing Termination of Logic Programs with Level Mappings,\u201d inProc. North American Conference on Logic Programming, Cleveland, Ohio, pp. 69\u201380, 1989."},{"key":"BF03037168_CR5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0890-5401(91)90073-B","volume":"91","author":"N. Bidoit","year":"1991","unstructured":"Bidoit, N. and Froidevaux, C., \u201cGeneral Logical Databases and Programs: Default Logic Semantics and Stratification,\u201dInformation and Computation, 91, pp. 15\u201354, 1991.","journal-title":"Information and Computation"},{"key":"BF03037168_CR6","series-title":"Report CS-R9075","volume-title":"Loop Checking and Negation","author":"R. Bol","year":"1990","unstructured":"Bol, R., \u201cLoop Checking and Negation,\u201dReport CS-R9075, Centre for Mathematics and Computer Science, Amsterdam, 1990."},{"key":"BF03037168_CR7","unstructured":"Cavedon, L., \u201cContinuity, Consistency, and Completeness Properties for Logic Programs,\u201d inProc. of the 6th International Conference on Logic Programming, The MIT Press, pp. 571\u2013584, 1989."},{"key":"BF03037168_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"Clark, K. L., \u201cNegation as Failure,\u201d inLogic and Data Bases, (H. Gallaire and J. Minker, eds.), Plenum Press, New York, pp. 293\u2013322, 1978."},{"key":"BF03037168_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N., \u201cTermination of Rewriting,\u201dJournal of Symbolic Computation, 3, pp. 69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"BF03037168_CR10","unstructured":"Elkan, C., \u201cA Perfect Logic for Reasoning about Action,\u201dmanuscript, University of Toronto, 1989."},{"key":"BF03037168_CR11","unstructured":"Evans, C., \u201cNegation-as-Failure as an Approach to the Hanks and McDermott Problem,\u201d inProc. of the 2nd International Symposium on Artificial Intelligence, Monterrey, Mexico, 1989."},{"key":"BF03037168_CR12","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., \u201cA Kripke-Kleene Semantics for General Logic Programs,\u201dJournal of Logic Programming, 2, pp. 295\u2013312, 1985.","journal-title":"Journal of Logic Programming"},{"key":"BF03037168_CR13","volume-title":"Proc. 2nd Workshop on Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., \u201cAutoepistemic Logic and Formalization of Commonsense Reasoning,\u201d inProc. 2nd Workshop on Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin, 1988."},{"key":"BF03037168_CR14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0004-3702(87)90043-9","volume":"33","author":"S. Hanks","year":"1987","unstructured":"Hanks, S. and McDermott, D., \u201cNonmonotonic Logic and Temporal Projection,\u201dArtificial Intelligence, 33, pp. 379\u2013412, 1987.","journal-title":"Artificial Intelligence"},{"key":"BF03037168_CR15","volume-title":"Introduction to Metamathematics","author":"S. C. Kleene","year":"1952","unstructured":"Kleene, S. C.,Introduction to Metamathematics, van Nostrand, New York, 1952."},{"key":"BF03037168_CR16","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., \u201cSigned Data Dependencies in Logic Programs,\u201dJournal of Logic Programming, 7, pp. 231\u2013246, 1989.","journal-title":"Journal of Logic Programming"},{"key":"BF03037168_CR17","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 Edition, Springer-Verlag, Berlin, 1987.","edition":"2nd Edition"},{"key":"BF03037168_CR18","unstructured":"Lifschitz, V., \u201cComputing Circumscription,\u201d inProc. IJCAI-85, pp. 121\u2013127, 1985."},{"key":"BF03037168_CR19","volume-title":"The Frame Problem in Artificial Intelligence","author":"V. Lifschitz","year":"1987","unstructured":"Lifschitz, V., \u201cFormal Theories of Action,\u201d inThe Frame Problem in Artificial Intelligence (F. Brown, ed.), Morgan Kaufmann, Los Altos, California, 1987."},{"key":"BF03037168_CR20","doi-asserted-by":"crossref","unstructured":"Maher, M. J., \u201cComplete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees,\u201d inProc. of the 3rd Annual Symposium on Logic in Computer Science, Edinburgh, pp. 348\u2013357, 1988.","DOI":"10.1109\/LICS.1988.5132"},{"key":"BF03037168_CR21","first-page":"262","volume-title":"The Metamathematics of Algebraic Systems: Collected Papers, Chapter 23","author":"A. Malcev","year":"1971","unstructured":"Malcev, A., \u201cAxiomatizable Classes of Locally Free Algebras of Various Types,\u201d inThe Metamathematics of Algebraic Systems: Collected Papers, Chapter 23, North-Holland, Amsterdam, pp. 262\u2013281, 1971."},{"key":"BF03037168_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy, J., \u201cCircumscription\u2014A Form of Non-Monotonic Reasoning,\u201dArtificial Intelligence, 13, pp. 27\u201339, 1980.","journal-title":"Artificial Intelligence"},{"key":"BF03037168_CR23","first-page":"463","volume-title":"Machine Intelligence 4","author":"J. McCarthy","year":"1969","unstructured":"McCarthy, J. and Hayes, P. J., \u201cSome Philosophical Problems from the Standpoint of Artificial Intelligence,\u201d inMachine Intelligence 4 (B. Meltzer and D. Mitchie, es.) Edinburgh University Press, Edinburgh, pp. 463\u2013502, 1969."},{"key":"BF03037168_CR24","unstructured":"Morris, P., \u201cCuring Anomalous Extensions,\u201d inProc. of AAAI, pp. 437\u2013442, 1987."},{"key":"BF03037168_CR25","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. C. Przymusinski","year":"1988","unstructured":"Przymusinski, T. C., \u201cOn the Declarative Semantics of Deductive Databases and Logic Programs,\u201d inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publishers, Los Altos, pp. 193\u2013216, 1988."},{"key":"BF03037168_CR26","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00243002","volume":"5","author":"T. C. Przymusinski","year":"1989","unstructured":"Przymusinski, T. C., \u201cOn the Declarative and procedural Semantics of Logic Programs,\u201dJournal of Automated Reasoning, 5, pp. 167\u2013205, 1989.","journal-title":"Journal of Automated Reasoning"},{"key":"BF03037168_CR27","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. C., \u201cEvery Logic Program Has a Natural Stratification and an Iterated Least Fixed Point Model,\u201d inProc. Principles of Database Systems (PODS\u201989), Philadelphia, 1989.","DOI":"10.1145\/73721.73723"},{"key":"BF03037168_CR28","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., \u201cNegation in Logic Programming,\u201d inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publishers, Los Altos, pp. 19\u201388, 1988."},{"key":"BF03037168_CR29","volume-title":"Mathematical Logic","author":"J. R. Shoenfield","year":"1967","unstructured":"Shoenfield, J. R.,Mathematical Logic, Addison-Wesley, Reading MA, 1967."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037168.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037168\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T10:37:42Z","timestamp":1633343862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":29,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["BF03037168"],"URL":"https:\/\/doi.org\/10.1007\/bf03037168","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}