000 | 03673nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-981-16-2944-0 | ||
003 | DE-He213 | ||
005 | 20240423125458.0 | ||
007 | cr nn 008mamaa | ||
008 | 211101s2021 si | s |||| 0|eng d | ||
020 |
_a9789811629440 _9978-981-16-2944-0 |
||
024 | 7 |
_a10.1007/978-981-16-2944-0 _2doi |
|
050 | 4 | _aQA76.63 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
072 | 7 |
_aUYQ _2thema |
|
082 | 0 | 4 |
_a005.115 _223 |
100 | 1 |
_aLi, Wei. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aR-CALCULUS: A Logic of Belief Revision _h[electronic resource] / _cby Wei Li, Yuefei Sui. |
250 | _a1st ed. 2021. | ||
264 | 1 |
_aSingapore : _bSpringer Nature Singapore : _bImprint: Springer, _c2021. |
|
300 |
_aXII, 200 p. 4 illus., 1 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aPerspectives in Formal Induction, Revision and Evolution, _x2731-3697 |
|
505 | 0 | _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. | |
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. . | ||
650 | 0 | _aLogic programming. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aMathematical logic. | |
650 | 0 | _aMathematical models. | |
650 | 0 | _aBig data. | |
650 | 1 | 4 | _aLogic in AI. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aMathematical Logic and Foundations. |
650 | 2 | 4 | _aMathematical Modeling and Industrial Mathematics. |
650 | 2 | 4 | _aBig Data. |
700 | 1 |
_aSui, Yuefei. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9789811629433 |
776 | 0 | 8 |
_iPrinted edition: _z9789811629457 |
776 | 0 | 8 |
_iPrinted edition: _z9789811629464 |
830 | 0 |
_aPerspectives in Formal Induction, Revision and Evolution, _x2731-3697 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-981-16-2944-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
942 | _cSPRINGER | ||
999 |
_c178381 _d178381 |