國立虎尾科技大學 |

R-CALCULUS: A Logic of Belief Revision

Record Type:	Language materials, printed : Monograph/item
Title/Author:	R-CALCULUS: A Logic of Belief Revision/ by Wei Li, Yuefei Sui.
Author:	Li, Wei.
other author:	Sui, Yuefei.
Description:	XII, 200 p. 4 illus., 1 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Artificial intelligence. -
Online resource:	https://doi.org/10.1007/978-981-16-2944-0
ISBN:	9789811629440

R-CALCULUS: A Logic of Belief Revision
Li, Wei.

R-CALCULUS: A Logic of Belief Revision[electronic resource] /by Wei Li, Yuefei Sui. - 1st ed. 2021. - XII, 200 p. 4 illus., 1 illus. in color.online resource. - Perspectives in Formal Induction, Revision and Evolution,2731-3697. - Perspectives in Formal Induction, Revision and Evolution,.

Introduction -- 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.

This 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. .

ISBN: 9789811629440

Standard No.: 10.1007/978-981-16-2944-0doiSubjects--Topical Terms:

559380
Artificial intelligence.

LC Class. No.: Q334-342

Dewey Class. No.: 006.3

R-CALCULUS: A Logic of Belief Revision
LDR:02948nam a22004215i 4500 001 1056876
003 DE-He213
005 20211101171122.0
007 cr nn 008mamaa
008 220103s2021 si | s |||| 0|eng d
020 $a 9789811629440 $9 978-981-16-2944-0
024 7 $a 10.1007/978-981-16-2944-0 $2 doi
035 $a 978-981-16-2944-0
050 4 $a Q334-342
050 4 $a QA76.9.L63
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
100 1 $a Li, Wei. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1024749
245 1 0 $a R-CALCULUS: A Logic of Belief Revision $h [electronic resource] / $c by Wei Li, Yuefei Sui.
250 $a 1st ed. 2021.
264 1 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2021.
300 $a XII, 200 p. 4 illus., 1 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Perspectives in Formal Induction, Revision and Evolution, $x 2731-3697
505 0 $a Introduction -- 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 $a This 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 $a Artificial intelligence. $3 559380
650 0 $a Computer logic. $3 786340
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Mathematical models. $3 527886
650 0 $a Big data. $3 981821
650 1 4 $a Logic in AI. $3 1228083
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Mathematical Logic and Foundations. $3 669393
650 2 4 $a Mathematical Modeling and Industrial Mathematics. $3 669172
650 2 4 $a Big Data. $3 1017136
700 1 $a Sui, Yuefei. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1362259
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9789811629433
776 0 8 $i Printed edition: $z 9789811629457
776 0 8 $i Printed edition: $z 9789811629464
830 0 $a Perspectives in Formal Induction, Revision and Evolution, $x 2731-3697 $3 1362260
856 4 0 $u https://doi.org/10.1007/978-981-16-2944-0
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)