000			03173nam a22004335i 4500
999			_c361687 _d361687 _x1
001			361687
003			ES-MaUEC
005			20240201092612.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			211101s2021 si | s |||| 0|eng d
020			_a9789811629440
024	7		_a10.1007/978-981-16-2944-0 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA303.2 _b2021 EB
100			_aLiu, Wei _9671005
245	1	0	_aR-CALCULUS: A Logic of Belief Revision _cby Wei Li, Yuefei Sui.
250			_aFirst edition 2021
264		1	_aSingapore _bSpringer International Publising _bSpringer International Publising _c2021.
300			_a1 recurso en línea (XII, 200 páginas) _b4 ilustraciones, 1 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aPerspectives in Formal Induction Revision and Evolution _x2731-3697
490	0		_aComputer Science (SpringerNature-11645)
490	0		_aComputer Science (R0) (SpringerNature-43710)
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	3		_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. .
988			_aSpringer_Computer_2021
650		7	_2embne _9138362 _aCálculo
700	1		_aSui, Yuefei
776	0	8	_iPrinted edition: _z9789811629433
776	0	8	_iPrinted edition: _z9789811629457
776	0	8	_iPrinted edition: _z9789811629464
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-981-16-2944-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2022 _dz _eh _zSI