乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T00:04:20Z","timestamp":1707005060150},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2578,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1016\/j.tcs.2006.02.025","type":"journal-article","created":{"date-parts":[[2006,3,31]],"date-time":"2006-03-31T12:14:54Z","timestamp":1143807294000},"page":"147-171","source":"Crossref","is-referenced-by-count":2,"title":["A characterization theorem for injective model classes axiomatized by general rules"],"prefix":"10.1016","volume":"360","author":[{"given":"Zhaohui","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Rong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shan","family":"Lu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2006.02.025_bib1","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1093\/logcom\/7.5.605","article-title":"Beyond rational monotonicity: some strong non-Horn rules for nonmonotonic inference relations","volume":"7","author":"Bezzazi","year":"1997","journal-title":"J. Logic. Comput."},{"key":"10.1016\/j.tcs.2006.02.025_bib2","series-title":"Modal Logic","author":"Blackburn","year":"2001"},{"issue":"2","key":"10.1016\/j.tcs.2006.02.025_bib3","doi-asserted-by":"crossref","first-page":"605","DOI":"10.2307\/2586557","article-title":"Belief contraction as nonmonotonic inference","volume":"65","author":"Bochman","year":"2000","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/j.tcs.2006.02.025_bib4","series-title":"Frontiers of belief revision","first-page":"195","article-title":"Contraction of epistemic states: a general theory","author":"Bochman","year":"2001"},{"key":"10.1016\/j.tcs.2006.02.025_bib5","series-title":"A Logical Theory of Nonmonotonic Inference and Belief Change","author":"Bochman","year":"2001"},{"key":"10.1016\/j.tcs.2006.02.025_bib6","series-title":"Model Theory","author":"Chang","year":"1977"},{"key":"10.1016\/j.tcs.2006.02.025_bib7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1093\/logcom\/3.3.231","article-title":"Injective models and disjunctive relations","volume":"3","author":"Freund","year":"1993","journal-title":"J. Logic Comput."},{"key":"10.1016\/j.tcs.2006.02.025_bib8","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/BF01057658","article-title":"Supracompact inference operations","volume":"52","author":"Freund","year":"1993","journal-title":"Studia Logica"},{"issue":"2","key":"10.1016\/j.tcs.2006.02.025_bib9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1093\/logcom\/6.2.263","article-title":"On negation rationality","volume":"6","author":"Freund","year":"1996","journal-title":"J. Logic Comput."},{"key":"10.1016\/j.tcs.2006.02.025_bib10","doi-asserted-by":"crossref","unstructured":"D.M. Gabbay, Theoretical foundation for nonmonotonic reasoning in expert systems, in: K.R. Apr (Eds.), Proc. NATO Advance Study Institute on Logics and Models of Concurrent Systems, LaColle-sur-loup, France, Springer, Berlin, 1985, pp. 439\u2013457.","DOI":"10.1007\/978-3-642-82453-1_15"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2006.02.025_bib11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","article-title":"Nonmonotonic reasoning, preferential models and cumulative logics","volume":"44","author":"Kraus","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/j.tcs.2006.02.025_bib12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(92)90041-U","article-title":"What does a conditional knowledge base entail?","volume":"55","author":"Lehmann","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/j.tcs.2006.02.025_bib13","doi-asserted-by":"crossref","unstructured":"D. Makinson, General patterns in nonmonotonic reasoning, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. III, Clarendon Press, Oxford, 1993 (Chapter 2).","DOI":"10.1093\/oso\/9780198537472.003.0002"},{"key":"10.1016\/j.tcs.2006.02.025_bib14","unstructured":"D. Makinson, Bridges from Classical to Nonmonotonic Logic, Texts in Computing, Vol. 5, King's College Publications, London, 2005."},{"issue":"3","key":"10.1016\/j.tcs.2006.02.025_bib15","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.2307\/2586702","article-title":"On representation theorems for nonmonotonic inference relation","volume":"65","author":"P\u00e9rez","year":"2000","journal-title":"J. Symbolic Logic"},{"issue":"4","key":"10.1016\/j.tcs.2006.02.025_bib16","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.2307\/2275152","article-title":"Belief contraction in the context of the general theory of rational choice","volume":"58","author":"Rott","year":"1993","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/j.tcs.2006.02.025_bib17","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.tcs.2005.08.029","article-title":"Similarity between preferential models","volume":"353","author":"Zhu","year":"2006","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2006.02.025_bib18","unstructured":"Z. Zhu, B. Li, S. Chen, Valuation-ranked preferential model, in: A. Cohn, F. Giunchilia, B. Selman (Eds.), The Seventh Internat. Conf. on Principle of Knowledge Representation and Reasoning (KR\u20192000), Breckenridge, Colorado, USA, Morgan Kaufmann Publishers, Los Altos, CA, April 11\u201315, 2000, 647\u2013653."},{"issue":"1","key":"10.1016\/j.tcs.2006.02.025_bib19","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/S0304-3975(02)00035-X","article-title":"A representation theorem for recovering contraction relations satisfying WCI","volume":"290","author":"Zhu","year":"2003","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2006.02.025_bib20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2178\/jsl\/1190150026","article-title":"Valuation structure","volume":"67","author":"Zhu","year":"2002","journal-title":"J. Symbolic. Logic"},{"key":"10.1016\/j.tcs.2006.02.025_bib21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0304-3975(03)00241-X","article-title":"Normal conditions for inference relations and injective models","volume":"309","author":"Zhu","year":"2003","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506001952?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506001952?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T14:54:07Z","timestamp":1706972047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397506001952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["S0304397506001952"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2006.02.025","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}