001440764 000__ 03444cam\a2200553\a\4500
001440764 001__ 1440764
001440764 003__ OCoLC
001440764 005__ 20230309004700.0
001440764 006__ m\\\\\o\\d\\\\\\\\
001440764 007__ cr\un\nnnunnun
001440764 008__ 211104s2021\\\\si\\\\\\ob\\\\001\0\eng\d
001440764 019__ $$a1283141694$$a1292517784$$a1294350554$$a1295585297
001440764 020__ $$a9789811629440$$q(electronic bk.)
001440764 020__ $$a9811629447$$q(electronic bk.)
001440764 020__ $$z9811629439
001440764 020__ $$z9789811629433
001440764 0247_ $$a10.1007/978-981-16-2944-0$$2doi
001440764 035__ $$aSP(OCoLC)1282593733
001440764 040__ $$aYDX$$beng$$epn$$cYDX$$dGW5XE$$dOCLCF$$dN$T$$dDKU$$dOCLCO$$dDCT$$dOCLCQ$$dOCLCO$$dSFB$$dUKAHL$$dOCLCQ
001440764 049__ $$aISEA
001440764 050_4 $$aQA303.2
001440764 08204 $$a515$$223
001440764 1001_ $$aLi, Wei.
001440764 24510 $$aR-CALCULUS :$$ba logic of belief revision /$$cWei Li, Yuefei Sui.
001440764 260__ $$aSingapore :$$bSpringer,$$c2021.
001440764 300__ $$a1 online resource
001440764 336__ $$atext$$btxt$$2rdacontent
001440764 337__ $$acomputer$$bc$$2rdamedia
001440764 338__ $$aonline resource$$bcr$$2rdacarrier
001440764 347__ $$atext file
001440764 347__ $$bPDF
001440764 4901_ $$aPerspectives in formal induction, revision and evolution,$$x2731-3697
001440764 504__ $$aIncludes bibliographical references and index.
001440764 5050_ $$aIntroduction -- Preliminaries -- R-calculi for Propositional Logic -- R-calculi for Description Logics -- R-calculi for Modal Logic -- R-calculi for Logic Programming -- R-calculi for First-order Logic -- Nonmonotonicity of R-calculus -- Approximate R-calculus -- An application to Default Logic -- An application to Semantic Networks.
001440764 506__ $$aAccess limited to authorized users.
001440764 520__ $$aThis book introduces new models based on R-calculus and theories of belief revision for dealing with large and changing data. It extends R-calculus from first-order logic to propositional logic, description logics, modal logic and logic programming, and from minimal change semantics to subset minimal change, pseudo-subformula minimal change and deduction-based minimal change (the last two minimal changes are newly defined). And it proves soundness and completeness theorems with respect to the minimal changes in these logics. To make R-calculus computable, an approximate R-calculus is given which uses finite injury priority method in recursion theory. Moreover, two applications of R-calculus are given to default theory and semantic inheritance networks. This book offers a rich blend of theory and practice. It is suitable for students, researchers and practitioners in the field of logic. Also it is very useful for all those who are interested in data, digitization and correctness and consistency of information, in modal logics, non monotonic logics, decidable/undecidable logics, logic programming, description logics, default logics and semantic inheritance networks.
001440764 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed November 15, 2021).
001440764 650_0 $$aCalculus.
001440764 650_6 $$aCalcul infinitésimal.
001440764 655_0 $$aElectronic books.
001440764 7001_ $$aSui, Yuefei,$$eauthor.
001440764 77608 $$iPrint version:$$z9811629439$$z9789811629433$$w(OCoLC)1249508010
001440764 830_0 $$aPerspectives in formal induction, revision and evolution,$$x2731-3697
001440764 852__ $$bebk
001440764 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-981-16-2944-0$$zOnline Access$$91397441.1
001440764 909CO $$ooai:library.usi.edu:1440764$$pGLOBAL_SET
001440764 980__ $$aBIB
001440764 980__ $$aEBOOK
001440764 982__ $$aEbook
001440764 983__ $$aOnline
001440764 994__ $$a92$$bISE