Bøger af Yuefei Sui

This book series consists of two parts, decidable description logics and undecidable description logics. It gives the R-calculi for description logics. This book offers a rich blend of theory and practice. It is suitable for students, researchers and practitioners in the field of logic.

This second volume of the book series shows R-calculus is a combination of one monotonic tableau proof system and one non-monotonic one. The R-calculus is a Gentzen-type deduction system which is non-monotonic, and is a concrete belief revision operator which is proved to satisfy the AGM postulates and the DP postulates. It discusses the algebraical and logical properties of tableau proof systems and R-calculi in many-valued logics. 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.

This fourth volume of the book series combines propositional logic and R-calculus for a new point of view to consider belief revision. It gives the R-calculi for propositional logic, description logics, propositional modal logic, logic programming, ¿-propositional logic, semantic networks, and three-valued logic, etc.. Applications of R-calculus in logic of supersequents are also given. This book offers a rich blend of theory and practice. It is suitable for students, researchers and practitioners in the field of logic.

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.  

This third volume of the book series shows R-calculus is a Gentzen-typed deduction system which is non-monotonic, and is a concrete belief revision operator which is proved to satisfy the AGM postulates and the DP postulates. In this book, R-calculus is taken as Tableau-based/sequent-based/multisequent-based to preserve the satisfiability of the Theory/sequent/multisequent to revise, or sequent-based, to preserve the satisfiability of the sequent to revise. The R-calculi for Post and three-valued logic is given.  This book offers a rich blend of theory and practice. It is suitable for students, researchers and practitioners in the field of logic. 

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