{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:40Z","timestamp":1759637860930},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1007\/bf01531080","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:09:06Z","timestamp":1113869346000},"page":"241-273","source":"Crossref","is-referenced-by-count":42,"title":["A theory of nonmonotonic rule systems I"],"prefix":"10.1007","volume":"1","author":[{"given":"W.","family":"Marek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Nerode","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Remmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1990,9,1]]},"reference":[{"key":"BF01531080_CR1","unstructured":"K.R. Apt., Introduction to logic programming, Technical Report TR-87-35, University of Texas (1988)."},{"key":"BF01531080_CR2","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K.R. Apt","year":"1987","unstructured":"K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1987)."},{"key":"BF01531080_CR3","doi-asserted-by":"crossref","unstructured":"N. Bidoit and C. Froidevaux, General logical databases and programs, default logic semantics, and stratification, J. Information and Comput., to appear.","DOI":"10.1016\/0890-5401(91)90073-B"},{"key":"BF01531080_CR4","unstructured":"H.A. Blair, A.L. Brown and V.S. Subrahmanian, Monotone logic programming, Technical Report CS-TR-2375, University of Maryland (1989)."},{"key":"BF01531080_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","volume":"28","author":"J. Kleer de","year":"1986","unstructured":"J. de Kleer, An assumption-based TMS, Artificial Intelligence 28 (1986) 127\u2013162.","journal-title":"Artificial Intelligence"},{"key":"BF01531080_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"R.P. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. 51 (1950) 161\u2013165.","journal-title":"Ann. Math."},{"key":"BF01531080_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(79)90008-0","volume":"12","author":"J. Doyle","year":"1979","unstructured":"J. Doyle, A truth maintenance system, Artificial Intelligence J. 12 (1979) 231\u2013272.","journal-title":"Artificial Intelligence J."},{"key":"BF01531080_CR8","unstructured":"M. Gelfond and V. Lifschitz, Stable semantics for logic programs, in:Proc. 5th Int. Symp. on Logic Programming, Seattle (1988)."},{"key":"BF01531080_CR9","unstructured":"M. Gelfond and V. Lifschitz, Logic programming with classical negation, unpublished manuscript (1989)."},{"key":"BF01531080_CR10","doi-asserted-by":"crossref","unstructured":"M. Gelfond and H. Przymusi\u0144ska, On the relationship between circumscription and autoepistemic logic, in:Proc. ISMIS Conf. (1986).","DOI":"10.1145\/12808.12836"},{"key":"BF01531080_CR11","unstructured":"M. Gelfond and H. Przymusi\u0144ska, Inheritance reasoning in autoepistemic logic, to appear in Fund. Inform."},{"key":"BF01531080_CR12","doi-asserted-by":"crossref","unstructured":"D. Gries,The Science of Programming (Springer, 1981).","DOI":"10.1007\/978-1-4612-5983-1"},{"key":"BF01531080_CR13","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"P. Hall, On representatives of subsets, J. London Math. Soc. 10 (1935) 26\u201330.","journal-title":"J. London Math. Soc."},{"key":"BF01531080_CR14","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1090\/S0002-9904-1948-09098-X","volume":"54","author":"M. Hall","year":"1948","unstructured":"M. Hall, Distinct representatives of subsets, Bull. Amer. Math. Soc. 54 (1948) 922\u2013926.","journal-title":"Bull. Amer. Math. Soc."},{"key":"BF01531080_CR15","doi-asserted-by":"crossref","unstructured":"J.Y. Halpern and Y.O. Moses, Knowledge and common knowledge in a distributed environment,3rd ACM Conf. on the Principles of Distributed Computing (1984) pp. 50\u201361.","DOI":"10.1145\/800222.806735"},{"key":"BF01531080_CR16","unstructured":"J. Hintikka,Knowledge and Belief (Cornell University Press, 1962)."},{"key":"BF01531080_CR17","unstructured":"W-Q. Huang and A. Nerode, Applications of pure recursion theory to recursive analysis, Acta Sinica 28 (1985)."},{"key":"BF01531080_CR18","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","volume":"35","author":"K. Konolige","year":"1988","unstructured":"K. Konolige, On the relation between default and autoepistemic logic, Artificial Intelligence J. 35 (1988) 343\u2013382.","journal-title":"Artificial Intelligence J."},{"key":"BF01531080_CR19","unstructured":"W. Marek and A. Nerode, Decision procedure for default logic, Mathematical Sciences Institute Reports, Cornell University (1990)."},{"key":"BF01531080_CR20","volume-title":"Principles of Knowledge Representation and Reasoning","author":"W. Marek","year":"1989","unstructured":"W. Marek and M. Truszczy\u0144ski, Relating autoepistemic and default logics, in:Principles of Knowledge Representation and Reasoning (Morgan Kaufmann, San Mateo, 1989). (Full version available as Technical Report 144-89, Computer Science, University of Kentucky, Lexington, KY 40506-0027, 1989.)"},{"key":"BF01531080_CR21","unstructured":"W. Marek and M. Truszczy\u0144ski, Stable models for logic programs and default logic, in:Proc. North American Conf. Logic Programming (MIT Press, 1989). (Full version available as Technical Report, Computer Science Department, University of Kentucky, Lexington, KY 40506-0027, 1989.)"},{"key":"BF01531080_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy, Circumscription \u2014 a form of nonmonotonic reasoning, Artificial Intelligence J. 13 (1980) 27\u201339.","journal-title":"Artificial Intelligence J."},{"key":"BF01531080_CR23","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0003-4843(79)90011-1","volume":"17","author":"G. Metakides","year":"1977","unstructured":"G. Metakides and A. Nerode, Effective content of field theory, Ann. Math. Logic 17 (1977) 289\u2013320.","journal-title":"Ann. Math. Logic"},{"key":"BF01531080_CR24","unstructured":"M. Minsky, A framework for representing knowledge, in:The Psychology of Computer Vision (McGraw-Hill, 1975) pp. 211\u2013272."},{"key":"BF01531080_CR25","volume-title":"Transversal Theory","author":"L. Mirsky","year":"1971","unstructured":"L. Mirsky,Transversal Theory (Academic Press, New York, 1971)."},{"key":"BF01531080_CR26","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R.C. Moore","year":"1985","unstructured":"R.C. Moore, Semantical considerations on non-monotonic logic, Artificial Intelligence J. 25 (1985) 75\u201394.","journal-title":"Artificial Intelligence J."},{"key":"BF01531080_CR27","doi-asserted-by":"crossref","unstructured":"A. Nerode and J.B. Remmel, A survey of r.e. substructures, Proc. Symp. Math. 42, Amer. Math. Soc. (1985) 323\u2013376.","DOI":"10.1090\/pspum\/042\/791067"},{"key":"BF01531080_CR28","unstructured":"A. Nerode and J.B. Remmel, Complexity-theoretic algebra I: vector spaces over finite fields, in:Structures in Complexity (1987) pp. 218\u2013241."},{"key":"BF01531080_CR29","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0168-0072(89)90047-X","volume":"44","author":"A. Nerode","year":"1989","unstructured":"A. Nerode and J.B. Remmel, Complexity-theoretic algebra II: Boolean algebras, Ann. Pure Appl. Logic 44 (1989) 71\u201399.","journal-title":"Ann. Pure Appl. Logic"},{"key":"BF01531080_CR30","doi-asserted-by":"crossref","unstructured":"A. Nerode and J.B. Remmel, Complexity-theoretic algebra III: bases of vector spaces, in:Feasible Mathematics (Springer, 1990).","DOI":"10.1007\/978-1-4612-3466-1_17"},{"key":"BF01531080_CR31","unstructured":"M. Reinfrank and O. Dressler, On the relation between truth maintenance and non-monotonic logics, in:Proc. Int. Joint Conf. on Artificial Intelligence (1989)."},{"key":"BF01531080_CR32","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter, A logic for default reasoning, Artificial Intelligence J. 13 (1980) 81\u2013132.","journal-title":"Artificial Intelligence J."},{"key":"BF01531080_CR33","unstructured":"J.B. Remmel, Recursive Boolean algebras, in:Handbook of Boolean Algebras, ed. J.D. Monk (North-Holland, 1989) chap. 25, pp. 1099\u20131165."},{"key":"BF01531080_CR34","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"H. Rogers, Jr.Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967)."},{"key":"BF01531080_CR35","unstructured":"A. Tarski,Logic, Semantics, Metamathematics (Oxford, 1956)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/BF01531080\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/BF01531080.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/BF01531080\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/BF01531080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T23:59:49Z","timestamp":1586217589000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/BF01531080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":35,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["BF01531080"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/bf01531080","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}