R-CALCULUS: A Logic of Belief Revision

  • Book
  • © 2021

Overview

  • Broadens your understanding on belief revision, and introduces the new models and theories based on R-calculus
  • Equips readers with theories to handle large and changing data
  • Inspires theoretic computer scientists by showing how R-calculus is developed into a series of complicated theories

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook EUR 85.59
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 106.99
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book EUR 149.79
Price includes VAT (Germany)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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 correctnessand consistency of information, in modal logics, non monotonic logics, decidable/undecidable logics, logic programming, description logics, default logics and semantic inheritance networks.  


Similar content being viewed by others

Keywords

Table of contents (11 chapters)

Authors and Affiliations

  • Beihang University, Bei**g, China

    Wei Li

  • Institute of Computing Technology, Chinese Academy of Sciences, Bei**g, China

    Yuefei Sui

About the authors

Wei Li, is a Professor in the School of Computer Science and Engineering, Beihang University, Bei**g, China and is a member of the Chinese Academy of Sciences. Prof. Li is mostly engaged in the applied research of Computer Software and Theory, and the Internet, including programming languages, software development, artificial intelligence, and integrated circuit design.

Yuefei Sui, is a Professor in the Institute of Computing Technology, Chinese Academy of Sciences, Bei**g, China. His main interests include knowledge representation, applied logic and the theory of computability.


Bibliographic Information

Publish with us

Navigation