國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

R-CALCULUSa logic of belief revision /

Li, Wei.

R-CALCULUSa logic of belief revision /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	R-CALCULUSby Wei Li, Yuefei Sui.
其他題名:	a logic of belief revision /
作者:	Li, Wei.
其他作者:	Sui, Yuefei.
出版者:	Singapore :Springer Singapore :2021.
面頁冊數:	xii, 200 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Calculus.
電子資源:	https://doi.org/10.1007/978-981-16-2944-0
ISBN:	9789811629440$q(electronic bk.)

R-CALCULUSa logic of belief revision /
Li, Wei.

R-CALCULUSa logic of belief revision /[electronic resource] :by Wei Li, Yuefei Sui. - Singapore :Springer Singapore :2021. - xii, 200 p. :ill., digital ;24 cm. - 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$q(electronic bk.)

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

183091
Calculus.

LC Class. No.: QA303.2 / .L5 2021

Dewey Class. No.: 515

R-CALCULUSa logic of belief revision /
LDR:02565nmm a2200337 a 4500 001 610489
003 DE-He213
005 20211101171122.0
006 m d
007 cr nn 008maaau
008 220330s2021 si s 0 eng d
020 $a 9789811629440$q(electronic bk.)
020 $a 9789811629433$q(paper)
024 7 $a 10.1007/978-981-16-2944-0 $2 doi
035 $a 978-981-16-2944-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA303.2 $b .L5 2021
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 515 $2 23
090 $a QA303.2 $b .L693 2021
100 1 $a Li, Wei. $3 279705
245 1 0 $a R-CALCULUS $h [electronic resource] : $b a logic of belief revision / $c by Wei Li, Yuefei Sui.
260 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2021.
300 $a xii, 200 p. : $b ill., digital ; $c 24 cm.
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 Calculus. $3 183091
650 1 4 $a Logic in AI. $3 836108
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Mathematical Logic and Foundations. $3 274479
650 2 4 $a Mathematical Modeling and Industrial Mathematics. $3 274070
650 2 4 $a Big Data. $3 760530
700 1 $a Sui, Yuefei. $3 908529
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Perspectives in formal induction, revision and evolution. $3 908530
856 4 0 $u https://doi.org/10.1007/978-981-16-2944-0
950 $a Computer Science (SpringerNature-11645)