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.