{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:26:42Z","timestamp":1648708002762},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s11390-005-0536-9","type":"journal-article","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T08:47:07Z","timestamp":1140166027000},"page":"536-541","source":"Crossref","is-referenced-by-count":0,"title":["Some Representation Theorems for Recovering Contraction Relations"],"prefix":"10.1007","volume":"20","author":[{"given":"Ping","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"536_CR1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"C E Alchourr\u00f3n","year":"1985","unstructured":"Alchourr\u00f3n C E, G\u00e4rdenfors P, Makinson D. On the logic of theory change: Partial meet contraction and revision functions. J. Symbolic Logic, 1985, 50(2): 510\u2013530.","journal-title":"J. Symbolic Logic"},{"key":"536_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF00284974","volume":"20","author":"A Fuhrmann","year":"1991","unstructured":"Fuhrmann A. Theory contraction through base contraction. J. Philosophical Logic, 1991, 20: 175\u2013203.","journal-title":"J. Philosophical Logic"},{"key":"536_CR3","doi-asserted-by":"crossref","first-page":"602","DOI":"10.2307\/2275221","volume":"58","author":"S O Hansson","year":"1993","unstructured":"Hansson S O. Theory contraction and base contraction unified. J. Symbolic Logic, 1993, 58: 602\u2013625.","journal-title":"J. Symbolic Logic"},{"key":"536_CR4","unstructured":"Nebel B. A knowledge level analysis of belief revision. In Proc. 1st Int. Conf. Principles of Knowledge Representation and Reasoning, Brachman R J (ed.), Morgan Kauffman, Los Altos, CA, 1989, pp.301\u2013311."},{"key":"536_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0004-3702(98)00112-X","volume":"108","author":"A Bochman","year":"1999","unstructured":"Bochman A. A foundational theory of belief change. Artificial Intelligence, 1999, 108: 309\u2013352.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"536_CR6","doi-asserted-by":"crossref","first-page":"605","DOI":"10.2307\/2586557","volume":"65","author":"A Bochman","year":"2000","unstructured":"Bochman A. Belief contraction as nonmonotonic inference. J. Symbolic Logic, 2000, 65(2): 605\u2013626.","journal-title":"J. Symbolic Logic"},{"key":"536_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0004-3702(99)00092-2","volume":"116","author":"A Bochman","year":"2000","unstructured":"Bochman A. A foundationalist view of the AGM theory of belief change. Artificial Intelligence, 2000, 116: 237\u2013263.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"536_CR8","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/S0304-3975(02)00035-X","volume":"290","author":"Zhu Zhaohui","year":"Jan. 2003","unstructured":"Zhaohui Zhu, Bin Li, Xi'an Xiao et al. A representation theorem for recovering contraction relations satisfying wci. Theoretical Computer Science, Jan. 2003, 290(1): 545\u2013564.","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"536_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S Kraus","year":"1990","unstructured":"Kraus S, Lehmann D, Magidor M. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 1990, 44(1-2): 167\u2013207.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"536_CR10","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.2307\/2275152","volume":"58","author":"H Rott","year":"1993","unstructured":"Rott H. Belief contraction in the context of the general theory of rational choice. J. Symbolic Logic, 1993, 58(4): 1426\u20131450.","journal-title":"J. Symbolic Logic"},{"key":"536_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1093\/logcom\/3.3.231","volume":"3","author":"M Freund","year":"1993","unstructured":"Freund M. Injective models and disjunctive relations. J. Logic and Computation, 1993, 3: 231\u2013247.","journal-title":"J. Logic and Computation"},{"key":"536_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(92)90041-U","volume":"55","author":"D Lehmann","year":"1992","unstructured":"Lehmann D, Magidor M. What does a conditional knowledge base entail? Artificial Intelligence, 1992, 55: 1\u201360.","journal-title":"Artificial Intelligence"},{"key":"536_CR13","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1093\/logcom\/7.5.605","volume":"7","author":"H Bezzazi","year":"1997","unstructured":"Bezzazi H, Makinson D, Pino P\u00e9rez R. Beyond rational monotonicity: Some strong non-Horn rules for nonmonotonic inference relations. J. Logic and Computation, 1997, 7: 605\u2013631.","journal-title":"J. Logic and Computation"},{"issue":"1","key":"536_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2178\/jsl\/1190150026","volume":"67","author":"Zhu Zhaohui","year":"2002","unstructured":"Zhaohui Zhu, Shifu Chen, Wujia Zhu. Valuation structure. J. Symbolic Logic, 2002, 67(1): 1\u201323.","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"536_CR15","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.2307\/2586702","volume":"65","author":"R Pino P\u00e9rez","year":"2000","unstructured":"R Pino P\u00e9rez, C Uzc\u00e1tegui. On representation theorems for nonmonotonic inference relation. J. Symbolic Logic, 2000, 65(3): 1321\u20131337.","journal-title":"J. Symbolic Logic"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-005-0536-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-005-0536-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-005-0536-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:32:35Z","timestamp":1559399555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-005-0536-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["536"],"URL":"https:\/\/doi.org\/10.1007\/s11390-005-0536-9","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}