{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T11:59:52Z","timestamp":1698407992029},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T00:00:00Z","timestamp":1222819200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2008,10]]},"abstract":"In this article, we propose a belief revision approach for families of (non-classical) logics whose semantics are first-order axiomatisable. Given any such (non-classical) logic $L$<\/jats:alt-text><\/jats:inline-graphic>, the approach enables the definition of belief revision operators for $L$<\/jats:alt-text><\/jats:inline-graphic>, in terms of a belief revision operation satisfying the postulates for revision theory proposed by Alchourr\u00f3n, G\u00e4rdenfors and Makinson (AGM revision, Alchourr\u00f3n et al.<\/jats:italic> (1985)). The approach is illustrated by considering the modal logic K<\/jats:italic>, Belnap's four-valued logic, and \u0141ukasiewicz's many-valued logic. In addition, we present a general methodology to translate algebraic logics into classical logic. For the examples provided, we analyse in what circumstances the properties of the AGM revision are preserved and discuss the advantages of the approach from both theoretical and practical viewpoints.<\/jats:p>","DOI":"10.1017\/s1755020308080246","type":"journal-article","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T09:29:02Z","timestamp":1229333342000},"page":"267-304","source":"Crossref","is-referenced-by-count":12,"title":["BELIEF REVISION IN NON-CLASSICAL LOGICS"],"prefix":"10.1017","volume":"1","author":[{"given":"DOV","family":"GABBAY","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ODINALDO","family":"RODRIGUES","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALESSANDRA","family":"RUSSO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,10,1]]},"reference":[{"key":"S1755020308080246_ref20","volume-title":"What Does Paraconsistency Do?","author":"Tanaka","year":"1997"},{"key":"S1755020308080246_ref18","first-page":"67","volume-title":"Wocfai 95: Proceedings of the Second World Conference on the Fundamentals of Artificial Intelligence","author":"Restall","year":"1995"},{"key":"S1755020308080246_ref17","doi-asserted-by":"publisher","DOI":"10.1111\/j.1755-2567.2001.tb00204.x"},{"key":"S1755020308080246_ref16","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/1.5.691"},{"key":"S1755020308080246_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90069-V"},{"key":"S1755020308080246_ref13","volume-title":"Knowledge in Flux: Modeling the Dynamics of Epistemic states. A Bradford Book","author":"G\u00e4rdenfors","year":"1988"},{"key":"S1755020308080246_ref12","first-page":"3","volume-title":"Revision by Translation","author":"Gabbay","year":"2000"},{"key":"S1755020308080246_ref10","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198511748.001.0001"},{"key":"S1755020308080246_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00284974"},{"key":"S1755020308080246_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00038-0"},{"key":"S1755020308080246_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511621192"},{"key":"S1755020308080246_ref5","first-page":"495","volume-title":"A Unified Compilation Style Labelled Deductive Systems for Modal, Substructural and Fuzzy Logic","author":"Broda","year":"2000"},{"key":"S1755020308080246_ref11","first-page":"71","volume-title":"Proceedings of the Seventh Conference on Logic and the Foundations of Games and Decision Theory (LOFT06)","author":"Gabbay","year":"2006"},{"key":"S1755020308080246_ref3","first-page":"30","volume-title":"Contemporary Aspects of Philosophy","author":"Belnap","year":"1977"},{"key":"S1755020308080246_ref7","author":"Darwiche","year":"1996"},{"key":"S1755020308080246_ref19","volume-title":"Relevance logic in computer science","author":"Shapiro","year":"1992"},{"key":"S1755020308080246_ref4","first-page":"8","volume-title":"Modern Uses of Multiple-Valued Logic","author":"Belnap","year":"1977"},{"key":"S1755020308080246_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(88)90031-8"},{"key":"S1755020308080246_ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2274239"},{"key":"S1755020308080246_ref2","volume-title":"A Useful Four-Valued Logic: How a Computer Should Think","author":"Anderson","year":"1992"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020308080246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T15:32:41Z","timestamp":1554046361000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020308080246\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["S1755020308080246"],"URL":"https:\/\/doi.org\/10.1017\/s1755020308080246","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"value":"1755-0203","type":"print"},{"value":"1755-0211","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}