{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T12:09:10Z","timestamp":1648555750894},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":3760,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0168-0072(02)00064-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:49:29Z","timestamp":1034077769000},"page":"151-163","source":"Crossref","is-referenced-by-count":2,"title":["The complexity of predicate default logic over a countable domain"],"prefix":"10.1016","volume":"120","author":[{"given":"Robert Saxon","family":"Milnikel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(02)00064-7_BIB1","doi-asserted-by":"crossref","unstructured":"D. Cenzer, J.B. Remmel, \u03a010 classes in mathematics, in: Y.L. Ershov, S.S. Goncharov, V.W. Marek, A. Nerode, J.B. Remmel (Eds.), Handbook of Recursive Mathematics, Vol. 2, North-Holland, Amsterdam, 1998.","DOI":"10.1016\/S0049-237X(98)80046-3"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB2","unstructured":"D.W. Etherington, Relating default logic and circumscription, in: Proc. 11th Internat. Joint Conf. on Artificial Intelligence, Milan, Italy, August 1987."},{"key":"10.1016\/S0168-0072(02)00064-7_BIB3","series-title":"Proc. 5th Ann. Symp. on Logic Programming","article-title":"The stable semantics for logic programs","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB4","unstructured":"J.-Y. Girard, Proof Theory and Logical Complexity, Vol. 1, Bibliopolis, Napooli, 1987."},{"key":"10.1016\/S0168-0072(02)00064-7_BIB5","unstructured":"J.-Y. Girard, Proof Theory and Logical Complexity, Vol. 2, North-Holland, Amsterdam, to appear."},{"key":"10.1016\/S0168-0072(02)00064-7_BIB6","unstructured":"R. Guerreiro, M. Casanova, An alternative semantics for default logic, preprint, in: The 3rd Internat. Workshop on Nonmonotonic Reasoning, South Lake Tahoe, 1990."},{"key":"10.1016\/S0168-0072(02)00064-7_BIB7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0004-3702(94)00035-Y","article-title":"A comparative study of open default theories","volume":"77","author":"Kaminski","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1093\/logcom\/8.2.169","article-title":"Extensions for open default theories via the domain closure assumption","volume":"8","author":"Kaminski","year":"1998","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0168-0072(02)00064-7_BIB9","unstructured":"V. Lifschitz, Computing circumscription, in: Proc. IJCAI, Los Angeles, CA, 1985."},{"key":"10.1016\/S0168-0072(02)00064-7_BIB10","series-title":"Computational Logic. Symposium Proceedings","article-title":"On open defaults","author":"Lifschitz","year":"1990"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB11","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","article-title":"Circumscription","volume":"Vol. 3","author":"Lifschitz","year":"1994"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0004-3702(92)90019-T","article-title":"A logic of knowledge and justified assumptions","volume":"57","author":"Lin","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01531080","article-title":"Nonmonotonic rule systems I","volume":"1","author":"Marek","year":"1990","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01543477","article-title":"Nonmonotonic rule systems II","volume":"5","author":"Marek","year":"1992","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB15","doi-asserted-by":"crossref","unstructured":"W. Marek, A. Nerode, J.B. Remmel, On the complexity of abduction, in: Proc. 11th Ann. IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1996.","DOI":"10.1109\/LICS.1996.561468"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB16","series-title":"Nonmonotonic Logic: Context-dependent Reasoning","author":"Marek","year":"1993"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription\u2014a form of nonmonotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","article-title":"Nonmonotonic logic I","volume":"13","author":"McDermott","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB19","unstructured":"R. Milnikel, Nonmonotonic logic: a monotonic approach, Ph.D. Thesis, Cornell University, May 1999 [for further reading]."},{"key":"10.1016\/S0168-0072(02)00064-7_BIB20","unstructured":"R. Milnikel, Tableau proofs for skeptical reasoning, in: T. Eiter, G. Gottlob (Eds.), Proc. FLOC \u201999 Workshop on Complexity-Theoretic and Recursion-Theoretic Methods in Databases, Artificial Intelligence, and Finite Model Theory, Trento, Italy, 1999, pp. 62\u201371."},{"key":"10.1016\/S0168-0072(02)00064-7_BIB21","unstructured":"R.C. Moore, Possible-world semantics for autoepistemic logic, in: R. Reiter (Ed.), Proc. Workshop on Non-Monotonic Reasoning, 1984. Reprinted in: Logic and Representation (CSLI Lecture Notes 39), Stanford Univ. Press, Stanford, CA, 1995, pp. 145\u2013151."},{"key":"10.1016\/S0168-0072(02)00064-7_BIB22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB23","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0168-0072(02)00064-7_BIB24","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0168-0072(87)90062-5","article-title":"Decidability and definability with circumscription","volume":"35","author":"Schlipf","year":"1987","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007202000647?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007202000647?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,8]],"date-time":"2020-03-08T12:13:45Z","timestamp":1583669625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007202000647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0168007202000647"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(02)00064-7","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}