{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T02:23:09Z","timestamp":1777429389903,"version":"3.51.4"},"reference-count":91,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/bf00140676","type":"journal-article","created":{"date-parts":[[2004,12,10]],"date-time":"2004-12-10T03:58:17Z","timestamp":1102651097000},"page":"163-210","source":"Crossref","is-referenced-by-count":11,"title":["Nonmonotonic reasoning"],"prefix":"10.1007","volume":"4","author":[{"given":"F. M.","family":"Donini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Lenzerini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Nardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Pirri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"765","volume-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","author":"K. R. Apt","year":"1988","unstructured":"Apt, K. R. & Blair, H. A. (1988) Arithmetic Classification of Perfect Models of Stratified Programs. Proceedings of the Fifth International Conference and Symposium on Logic Programming, pp. 765?779, MIT Press, Cambridge, MA."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Database and Logic Programming","author":"K. R. Apt","year":"1988","unstructured":"Apt, K. R., Blair, H. A. & Walker, A. (1988) Towards a Theory of Declarative Knowledge. In Foundations of Deductive Database and Logic Programming (ed. J., Minker), pp. 89?148, Morgan Kaufmann Publisher, Los Altos, CA."},{"key":"CR3","unstructured":"Baker, A. B. (1989) A Simple Solution to the Yale Shooting Problem. Proceedings KR-89, pp. 11?20."},{"key":"CR4","unstructured":"Baker, A. B. & Ginsberg, M. L. (1989) A Theorem Prover for Prioritized Circumscription. Proceedings IJCAI-89, pp. 463?467."},{"key":"CR5","unstructured":"Belnap, N. D. (1977a) How a Computer Should Think. In Contemporary Aspects of Philosophy (ed. G. Ryle), pp. 30?56. Oriel Press."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Belnap, N. D. (1977b) A Useful Four-Valued Logic. In Modern Uses of Multiple-Valued Logic, (eds J. Dunn & G. Epstein) pp. 8?37, D. Reidel Publisher.","DOI":"10.1007\/978-94-010-1161-7_2"},{"key":"CR7","first-page":"80","volume":"6","author":"R. J. Brachman","year":"1985","unstructured":"Brachman, R. J. (1985) I Lied about the Trees (or, Defaults and Definitions in Knowledge Representation). AI Magazine, 6, 80?93.","journal-title":"AI Magazine"},{"key":"CR8","unstructured":"Cadoli, M., Lenzerini, M., Nardi, D. & Pirri, F. (1990) Circumscription and Nonmonotonic Inheritance. Technical Report, Dipartimento di Informatica e Sistemistica. Universit\u00e0 di Roma ?La Sapienza?."},{"key":"CR9","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. (1978) Negation as Failure. In Logic and Data Bases (eds H., Gallaire & J., Minker), pp. 293?322. Plenum, New York."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","volume":"28","author":"J. Kleer De","year":"1986","unstructured":"De, Kleer, J. (1986) An Assumption Based TMS. Artificial Intelligence, 28, 127?162.","journal-title":"Artificial Intelligence"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0004-3702(89)90018-0","volume":"39","author":"J. Kleer De","year":"1989","unstructured":"De, Kleer, J. & Konolige, K. (1989) Eliminating the Fixed Predicates form Circumscription. Artificial Intelligence, 39, 391?398.","journal-title":"Artificial Intelligence"},{"key":"CR12","unstructured":"Etherington, D. W. & Reiter, R. (1983) On Inheritance Hierarchies with Exceptions. Proceedings AAAI-83, pp. 104?108."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1111\/j.1467-8640.1985.tb00055.x","volume":"1","author":"D. W. Etherington","year":"1985","unstructured":"Etherington, D. W., Mercer, R. & Reiter, R. (1985) On the Adequacy of Predicate Circumscription for Closed-world Reasoning. Computational Intelligence, 1, 11?15.","journal-title":"Computational Intelligence"},{"key":"CR14","series-title":"Research Notes in AI","volume-title":"Reasoning from Incomplete Information","author":"D. W. Etherington","year":"1987","unstructured":"Etherington, D. W. (1987a). Reasoning from Incomplete Information. Research Notes in AI, Pitman, London."},{"key":"CR15","unstructured":"Etherington, D. W. (1987b) More On Inheritance Hierarchies with Exceptions. Proceedings AAAI-87, pp. 352?357."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/42404.42405","volume":"31","author":"R. E. Filman","year":"1988","unstructured":"Filman, R. E. (1988) Reasoning with Worlds and Truth Maintenance in a Knowledge-based Programming Environment. Communications of the ACM, 31, 382?401.","journal-title":"Communications of the ACM"},{"key":"CR17","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. (1985) A Kripke-Kleene Semantics for Logic Programs. Journal of Logic Programming, 2, 295?312.","journal-title":"Journal of Logic Programming"},{"key":"CR18","first-page":"1054","volume-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","author":"M. Fitting","year":"1988","unstructured":"Fitting, M. & Ben-Jacob, M. (1988) Stratified and Three-valued Logic Programming Semantics. Proceedings of the Fifth International Conference and Symposium on Logic Programming, pp. 1054?1069. MIT Press, Cambridge, MA."},{"key":"CR19","unstructured":"Gelfond, M. (1987) On Stratified Autoepistemic Theories. Proceedings AAAI-87, pp. 207?211."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Gelfond, M. (1989) Autoepistemic Logic and Formalization of Commonsense Reasoning: Preliminary Report. In Non-monotonic Reasoning Proceedings of the Second International Workshop, LNAI, Springer-Verlag. pp. 176?187.","DOI":"10.1007\/3-540-50701-9_27"},{"key":"CR21","first-page":"1070","volume-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M. & Lifschitz, V. (1988) The Stable Model Semantics for Logic Programming. Proceedings of the Fifth International Conference and Symposium on Logic Programming, pp. 1070?1080. MIT Press, Cambridge, MA."},{"key":"CR22","unstructured":"Gelfond, M. & Lifschitz, V. (1989) Compiling Circumscriptive Theories into Logic Programming. In Non-monotonic Reasoning, Proceedings of the Second International Workshop, LNAI, Springer-Verlag, pp. 74?99."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(86)90001-9","volume":"30","author":"M. Gelfond","year":"1986","unstructured":"Gelfond, M. & Przymusinska, H. (1986) Negation as Failure: Careful Closure Procedure. Artificial Intelligence, 30, 273?289.","journal-title":"Artificial Intelligence"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","volume":"38","author":"M. Gelfond","year":"1989","unstructured":"Gelfond, M., Przymusinska, H. & Przymusinski, T. (1989) On the Relationship between Circumscription and Negation as Failure. Artificial Intelligence, 38, 75?94.","journal-title":"Artificial Intelligence"},{"key":"CR25","volume-title":"Readings in Non Monotonic Reasoning","year":"1988","unstructured":"Ginsberg, M. L. (ed) (1988a) Readings in Non Monotonic Reasoning. Morgan Kaufmann, Los Altos, CA."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1111\/j.1467-8640.1988.tb00280.x","volume":"4","author":"M. L. Ginsberg","year":"1988","unstructured":"Ginsberg, M. L. (1988b) Multivalued Logics: a Uniform Approach to Reasoning in Artificial Intelligence. Computational Intelligence, 4, 265?316.","journal-title":"Computational Intelligence"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0004-3702(89)90026-X","volume":"39","author":"M. L. Ginsberg","year":"1989","unstructured":"Ginsberg, M. L. (1989) A Circumscriptive Theorem Prover. Artificial Intelligence, 39, 209?231.","journal-title":"Artificial Intelligence"},{"key":"CR28","unstructured":"Goodwin, S. D. & Goebel, R. G. (1989) Non-Monotonic Reasoning in Temporal Domains: The Knowledge Independence Problem. In Non-Monotonic Reasoning, Proceedings of the Second International Workshop, LNAI 346, Springer-Verlag, pp. 187?202."},{"key":"CR29","unstructured":"Halpern, J. Y. & Moses, Y. O. (1985) A Guide to the Modal Logics of Knowledge and Belief. Proceedings IJCAI-85, pp. 51?60."},{"key":"CR30","unstructured":"Hanks, S. & McDermott, D. (1986) Default Reasoning, Nonmonotonic Logics and the Frame Problem. Proceedings AAAI-86, pp. 328?333."},{"key":"CR31","unstructured":"Horty, J. F. & Thomason, R. H. (1988) Mixing Strict and Defeasible Inheritance. AAAI-88, pp. 427?432."},{"key":"CR32","unstructured":"Horty, J. F., Thomason, R. H. & Touretzky, D. S. (1987) A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks. Proceedings AAAI-87, pp. 358?363. (An extended version of the paper has appeared as Technical Report CMU-CS-87-175, Computer Science Department, Carnegie Mellon University, 1987.)"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0004-3702(87)90064-6","volume":"32","author":"T. Imielinski","year":"1987","unstructured":"Imielinski, T. (1987) Results on Translating Defaults to Circumscription. Artificial Intelligence, 32, 131?146.","journal-title":"Artificial Intelligence"},{"key":"CR34","unstructured":"Kautz, H. A. (1986) The Logic of Persistence. AAAI-86, pp. 401?405."},{"key":"CR35","unstructured":"Kautz, H. A. & Selman, B. (1989) Hard Problems for Simple Default Logic. Proceedings of KR-89, pp. 189?197."},{"key":"CR36","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","volume":"35","author":"K. Konolige","year":"1988","unstructured":"Konolige, K. (1988) On the Relation Between Default and Autoepistemic Logic. Artificial Intelligence, 35, 343?382.","journal-title":"Artificial Intelligence"},{"key":"CR37","unstructured":"Konolige, K. (1989) On the Relation Between Autoepistemic Logic and Circumscription. Proceedings IJCAI-89, pp. 1213?1218."},{"key":"CR38","unstructured":"Krishnaprasad, T., Kifer, M. & Warren, D. S. (1989) On the Circumscriptive Semantics of Inheritance Networks. ISMIS-89, pp. 448?457."},{"key":"CR39","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kunen, K. (1987) Negation in Logic Programming. Journal of Logic Programming, 4, 289?308.","journal-title":"Journal of Logic Programming"},{"key":"CR40","first-page":"978","volume-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","author":"K. Kunen","year":"1988","unstructured":"Kunen, K. (1988) Some Remarks on the Completed Database. Proceedings of the Fifth International Conference and Symposium on Logic Programming, pp. 978?992. MIT Press, Cambridge, MA."},{"key":"CR41","first-page":"39","volume":"10","author":"C. Langlotz","year":"1989","unstructured":"Langlotz, C. & Shortliffe, E. H. (1989) Logical and Decision Theoretic Methods for Planning under Uncertainty, AI Magazine, 10, 39?48.","journal-title":"AI Magazine"},{"key":"CR42","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(84)90009-2","volume":"23","author":"H. Levesque","year":"1984","unstructured":"Levesque, H. (1984) Foundations of a Functional Approach to Knowledge Representation. Artificial Intelligence, 23, 155?212.","journal-title":"Artificial Intelligence"},{"key":"CR43","unstructured":"Lifschitz, V. (1985a) Computing Circumscription. Proceedings IJCAI-85, pp. 121?127."},{"key":"CR44","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0004-3702(85)90055-4","volume":"27","author":"V. Lifschitz","year":"1985","unstructured":"Lifschitz, V. (1985b) Closed-world Databases and Circumscription. Artificial Intelligence, 27, 229?235.","journal-title":"Artificial Intelligence"},{"key":"CR45","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(86)90028-7","volume":"28","author":"V. Lifschitz","year":"1986","unstructured":"Lifschitz, V. (1986a) On the Satisfiability of Circumscription. Artificial Intelligence, 28, 17?27.","journal-title":"Artificial Intelligence"},{"key":"CR46","unstructured":"Lifschitz, V. (1986b) Pointwise Circumscription. AAAI-86, pp. 406?410."},{"key":"CR47","doi-asserted-by":"crossref","unstructured":"Lifschitz, V. (1987) Formal Theories of Action. Proceedings of the 1987 Workshop on the Frame Problem in Artificial Intelligence, pp. 35?57.","DOI":"10.1016\/B978-0-934613-32-3.50009-5"},{"key":"CR48","first-page":"235","volume-title":"Proceedings of KR-89","author":"V. Lifschitz","year":"1989","unstructured":"Lifschitz, V. (1989) Between Circumscription and Autoepistemic Logic. Proceedings of KR-89, pp. 235?244. Morgan Kaufmann, Los Altos, CA."},{"key":"CR49","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. (1987) Foundations of Logic Programming. 2nd, (extended) edition, Springer-Verlag, Berlin.","edition":"2nd, (extended)"},{"key":"CR50","unstructured":"Lukaszewicz, W. (1985) Two Results on Default Logic. Proceedings IJCAI-85, pp. 459?461."},{"key":"CR51","unstructured":"McCarthy, J. (1977) Epistemological Problems of Artificial Intelligence. Proceedings IJCAI-77, pp. 1038?1044."},{"key":"CR52","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. (1980) Circumscription?a Form of Non-Monotonic Reasoning. Artificial Intelligence, 13, 27?39.","journal-title":"Artificial Intelligence"},{"key":"CR53","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J. (1986) Application of Circumscription to Formalize Common-sense Knowledge. Artificial Intelligence, 28, 89?116.","journal-title":"Artificial Intelligence"},{"key":"CR54","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/322290.322293","volume":"29","author":"D. McDermott","year":"1982","unstructured":"McDermott, D. (1982) Non-monotonic Logic II: Non-monotonic Modal Theories. JACM, 29, 33?57.","journal-title":"JACM"},{"key":"CR55","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1111\/j.1467-8640.1987.tb00183.x","volume":"3","author":"D. McDermott","year":"1987","unstructured":"McDermott, D. (1987) A Critique of Pure Reason. Computational Intelligence, 3, 151?160.","journal-title":"Computational Intelligence"},{"key":"CR56","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","volume":"13","author":"D. McDermott","year":"1980","unstructured":"McDermott, D. & Doyle, J. (1980) Non-monotonic Logic I, Artificial Intelligence, 13, 41?72.","journal-title":"Artificial Intelligence"},{"key":"CR57","unstructured":"Minker, J. (1982) On Indefinite Data Bases and the Closed World Assumption. Proceedings of the Sixth Conference on Automated Deduction, LNCS 138, Springer-Verlag, pp. 292?308."},{"key":"CR58","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R. Moore","year":"1985","unstructured":"Moore, R. (1985) Semantical Considerations on Nonmonotonic Logic. Artificial Intelligence, 25, 75?94.","journal-title":"Artificial Intelligence"},{"key":"CR59","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0004-3702(88)90022-7","volume":"35","author":"P. H. Morris","year":"1988","unstructured":"Morris, P. H. (1988) The Anomalous Extension Problem in Default Reasoning. Artificial Intelligence, 35, 383?399.","journal-title":"Artificial Intelligence"},{"key":"CR60","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0004-3702(88)90003-3","volume":"36","author":"D. Perlis","year":"1988","unstructured":"Perlis, D. (1988) Autocircumscription. Artificial intelligence, 36, 223?236.","journal-title":"Artificial intelligence"},{"key":"CR61","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","volume":"36","author":"D. L. Poole","year":"1988","unstructured":"Poole, D. L. (1988) A Logical Framework for Default Reasoning. Artificial Intelligence, 36, 27?47.","journal-title":"Artificial Intelligence"},{"key":"CR62","doi-asserted-by":"crossref","unstructured":"Poole, D. L., Goebel, R. G. & Aleliunas, R. (1987) Theorist: A Logical Reasoning System for Defaults and Diagnosis. In The Knowledge Frontier: Essays in the Representation of Knowledge, (eds N. Cercone & G. McCalla), Springer-Verlag, pp. 331?352.","DOI":"10.1007\/978-1-4612-4792-0_13"},{"key":"CR63","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/B978-0-934613-40-8.50009-9","volume-title":"Foundations of Deductive Database and Logic Programming","author":"T. C. Przymusinski","year":"1988","unstructured":"Przymusinski, T. C. (1988) On The Semantics of Stratified Deductive Database. In Foundations of Deductive Database and Logic Programming, (ed. J., Minker), pp. 193?216. Morgan Kaufmann, Los Altos, CA."},{"key":"CR64","first-page":"167","volume":"5","author":"T. C. Prymusinski","year":"1989","unstructured":"Prymusinski, T. C. (1989a) On the Declarative and Procedural Semantics of Logic Programs. Journal of Automated Reasoning, 5, 167?205.","journal-title":"Journal of Automated Reasoning"},{"key":"CR65","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. C. (1989b) Every Logic Program has a Natural Stratification and an Iterated Fixed Point Model. Proceedings of ACM SIGACT-SIGMOD Symposium on Principles of Database Systems.","DOI":"10.1145\/73721.73723"},{"key":"CR66","first-page":"341","volume-title":"Proceedings of KR-89","author":"T. C. Przymusinski","year":"1989","unstructured":"Przymusinski, T. C. (1989c) Three-Valued Formalizations of Non Monotonic Reasoning and Logic Programming, Proceedings of KR-89, Morgan Kaufmann, Los Altos, CA, pp. 341?348."},{"key":"CR67","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T. C. Przymusinski","year":"1989","unstructured":"Przymusinski, T. C. (1989d) An Algorithm to Compute Circumscription. Artificial Intelligence, 38, 49?73.","journal-title":"Artificial Intelligence"},{"key":"CR68","unstructured":"Przymusinski, T. C. (1989e) Non-Monotonic Formalisms and Logic Programming. Proceedings of the Sixth International Conference on Logic Programming, pp. 665?674."},{"key":"CR69","unstructured":"Przymusinski, T. C. & Przymusinska, H. (1988) Weakly Perfect Model Semantics For Logic Programs. Proceedings of the Fifth International Conference on Logic Programming, pp. 1106?1120."},{"key":"CR70","unstructured":"Rathman, P. K. & Winslett, M. (1989) Circumscribing Equality. Proceedings IJCAI-89, pp. 468?473."},{"key":"CR71","doi-asserted-by":"crossref","unstructured":"Reinfrank, M., de Kleer, J., Ginsberg, M. L. & Sandewall, E. (eds) (1989) Non-Monotonic Reasoning, Proceedings of the Second International Workshop, LNAI 346, Springer-Verlag.","DOI":"10.1007\/3-540-50701-9"},{"key":"CR72","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4684-3384-5_3","volume-title":"Logic and Data Bases","author":"R. Reiter","year":"1978","unstructured":"Reiter, R. (1978) On Closed World Data Bases. In Logic and Data Bases (eds H., Gallaire & J., Minker), pp. 55?76. Plenum, New York."},{"key":"CR73","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R. (1980) A Logic for Default Reasoning, Artificial Intelligence, 13, 81?132.","journal-title":"Artificial Intelligence"},{"key":"CR74","unstructured":"Reiter, R. (1982) Circumscription Implies Predicate Completion (Sometimes). Proceedings AAAI-82, pp. 418?420."},{"key":"CR75","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1146\/annurev.cs.02.060187.001051","volume":"2","author":"R. Reiter","year":"1987","unstructured":"Reiter, R. (1987) Nonmonotonic Reasoning. Annual Review of Computer Science, Vol. 2, pp. 147?186.","journal-title":"Annual Review of Computer Science"},{"key":"CR76","unstructured":"Reiter, R. & Criscuolo, G. (1981) On Interacting Defaults. Proceedings IJCAI-81, pp. 270?276."},{"issue":"74","key":"CR77","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/PROC.1986.13636","volume":"10","author":"E. Sandewall","year":"1986","unstructured":"Sandewall, E. (1986) Nomonotonic Inference Rules for Multiple Inheritance with Exceptions. Proceedings of IEEE, Special Issue on Knowledge Representation, (74), 10, 1345?1353.","journal-title":"Proceedings of IEEE"},{"key":"CR78","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0168-0072(87)90062-5","volume":"35","author":"J. S. Schlipf","year":"1987","unstructured":"Schlipf, J. S. (1987) Decidability and Definability with Circumscription. Annals of Pure and applied Logic, 35, 173?191.","journal-title":"Annals of Pure and applied Logic"},{"key":"CR79","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","volume":"1","author":"J. C. Shepherdson","year":"1984","unstructured":"Shepherdson, J. C. (1984) Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World assumption. Journal of Logic Programming, 1, 51?69.","journal-title":"Journal of Logic Programming"},{"key":"CR80","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(85)90018-4","volume":"3","author":"J. C. Shepherdson","year":"1985","unstructured":"Shepherdson, J. C. (1985) Negation as Failure II, Journal of Logic Programming, 3, 185?202.","journal-title":"Journal of Logic Programming"},{"key":"CR81","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/B978-0-934613-40-8.50005-1","volume-title":"Foundations of Deductive Database and Logic Programming","author":"J. C. Shepherdson","year":"1988","unstructured":"Shepherdson, J. C. (1988) Negation in Logic Programming. In Foundations of Deductive Database and Logic Programming, (ed. J., Minker), pp. 19?89. Morgan Kaufmann, Los Altos, CA."},{"key":"CR82","unstructured":"Shoham, Y. (1986) Cronological Ignorance. Proceedings AAAI-86, pp. 389?393."},{"key":"CR83","unstructured":"Shoham, Y. (1987) What is the Frame Problem? Proceedings of the 1987 Workshop on the Frame Problem in Artificial Intelligence, pp. 5?21."},{"key":"CR84","first-page":"227","volume-title":"Readings in Non Monotonic Reasoning","author":"Y. Shoham","year":"1988","unstructured":"Shoham, Y. (1988) A Semantical Approach to Nonmonotonic logics. In Readings in Non Monotonic Reasoning. Morgan Kaufmann, Los Altos, CA. pp. 227?251."},{"key":"CR85","doi-asserted-by":"crossref","unstructured":"Thomason, R. H. & Horty, J. F. (1989) Logics for Inheritance Theory. In Non Monotonic Reasoning, Proceedings of the Second International Workshop LNAI, Springer-Verlag. pp. 220?237.","DOI":"10.1007\/3-540-50701-9_30"},{"key":"CR86","doi-asserted-by":"crossref","unstructured":"Thomason, R. H., Horty, J. F. & Touretzky, D. S. (1987) A Calculus for Inheritance in Monotonic Semantic Nets. Proceedings ISMIS-87, pp. 280?287.","DOI":"10.21236\/ADA188746"},{"key":"CR87","volume-title":"The Mathematics of Inheritance Systems","author":"D. S. Touretzky","year":"1986","unstructured":"Touretzky, D. S. (1986) The Mathematics of Inheritance Systems. Morgan Kaufmann, Los Altos, CA."},{"key":"CR88","unstructured":"Touretzky, D. S., Horty, J. F. & Thomason, R. H. (1987) A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems. Proceedings IJCAI-87, pp. 476?482."},{"key":"CR89","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"3","author":"M. H. Emden Van","year":"1976","unstructured":"Van, Emden, M. H. & Kowalski, R. A. (1976) The Semantics of Predicate Logic as a Programming Language. JACM, 3, 733?742.","journal-title":"JACM"},{"key":"CR90","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/B978-0-934613-40-8.50007-5","volume-title":"Foundations of Deductive Database and Logic Programming","author":"A. Gelder Van","year":"1988","unstructured":"Van, Gelder, A. (1988) Negation as Failure Using Tight Derivations for General Logic Programs. In Foundations of Deductive Database and Logic Programming, (ed. J., Minker), pp. 149?176. Morgan Kaufmann, Los Altos, CA."},{"key":"CR91","doi-asserted-by":"crossref","unstructured":"Van Gelder, A., Ross, K. A. & Schlipf, J. S. (1988) The Well-Founded Semantics for General Logic Programs. Proceedings of ACM SIGACT-SIGMOD Symposium on Principles of Database Systems.","DOI":"10.1145\/308386.308444"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00140676.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00140676\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00140676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T16:24:42Z","timestamp":1586017482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00140676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"references-count":91,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990]]}},"alternative-id":["BF00140676"],"URL":"https:\/\/doi.org\/10.1007\/bf00140676","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}