Anmerkung: Intro -- Preface -- Contents -- 1 Background and Overview -- 1.1 Introductory Discussion -- 1.2 Focusing on `Acceptability' Rather than `Inconsistency' -- 1.3 Overview of This Book -- 1.4 Notation Used in This Book -- 1.5 Basic Mathematical Notions -- References -- 2 Introducing Revision Theory -- 2.1 AGM Belief Revision -- 2.2 Katsuno and Mendelzon's Characterisation -- 2.3 Counterfactual Statements and the Ramsey Test -- 2.4 Grove's Systems of Spheres -- 2.5 Epistemic Entrenchment -- 2.6 Discussion -- 2.7 Action Updates -- 2.8 Generalising the Concept of Revision -- 2.9 Iterating the Revision Operation -- 2.9.1 Darwiche and Pearl's Postulates for Iterated Revisions -- 2.9.2 Lehmann's Approach: Belief Revision, Revised -- 2.10 Compromise Revision -- 2.11 Controlled Revision -- 2.12 Revision by Translation -- 2.13 A General Setting for Algorithmic Revision -- 2.14 Outline of This Book -- References -- 3 Stepwise Revision Operations -- 3.1 Introduction -- 3.2 Quantitative Measurement of Change -- 3.2.1 Minimal Change and the Function d -- 3.3 Qualitative Measurements of Change -- 3.4 Representation Issues -- 3.5 Revision of Formulae -- 3.6 Properties of the Revision Operator r -- 3.7 Other Belief Change Operators -- 3.7.1 Belief Contraction -- 3.7.2 Consolidating Information on the Belief Base -- 3.8 Comparison with Other Belief Change Operators -- 3.9 Operators for Reasoning About the Effects of Actions -- 3.9.1 Updates of Sentences via Distance d -- 3.9.2 Properties of the Action Update Operator -- 3.9.3 Action Updates of Sentences via Distance diff -- 3.9.4 Ambiguous Action Updates -- 3.9.5 Taking Causality into Account -- References -- 4 Iterating Revision -- 4.1 Introduction -- 4.2 Motivating Structure for Belief Revision -- 4.3 Iteration of the Revision Operation -- 4.4 Prioritised Databases -- 4.4.1 Properties of the Revisions of PDBs. , 4.4.2 Discussion about Iteration of Revision -- 4.5 Structured Databases -- 4.6 Applications and Examples -- 4.7 Related Work -- 4.7.1 Prioritised Base Revision -- 4.7.2 Ordered Theory Presentations -- 4.8 Using Additional Information for Action Updates -- References -- 5 Structured Revision -- 5.1 Identifying Inconsistency -- 5.2 Reasoning with Partial Priorities -- 5.2.1 Degree of Confidence/Reliability of the Source -- 5.2.2 Linearisations -- 5.3 Clustering -- 5.4 Applications in Software Engineering -- 5.4.1 Requirements Specification -- 5.4.2 An Example with the Light Control System -- References -- 6 Algorithmic Context Revision -- 6.1 Introduction -- 6.2 Abductive Revision -- 6.2.1 Introducing LDS for -- 6.2.2 Goal-Directed Algorithm for -- 6.2.3 Discussion on the Abduction Procedure -- 6.2.4 Abduction Algorithm for -- 6.2.5 Abduction for Intuitionistic Logic -- 6.3 Compromise Revision -- 6.3.1 Introducing Compromise Revision for -- 6.3.2 Comparison with AGM Revision -- 6.4 Controlled Revision -- 6.4.1 Proof Theory -- 6.4.2 Policies for Inconsistency -- 6.4.3 Conclusions -- References -- 7 Revision by Translation -- 7.1 Introduction -- 7.2 Belief Revision for Modal Logic -- 7.2.1 An Overview of Propositional Modal Logics -- 7.2.2 Hilbert Systems for Modal Logics -- 7.2.3 Translation of the Modal Logic K into Classical Logic -- 7.3 Revising in Łukasiewicz' Finitely Many-Valued Logic Łn -- 7.3.1 Łukasiewicz' Finitely Many-Valued Logic Łn -- 7.3.2 Translating Łukasiewicz' Many-Valued Logic Łn into Classical Logic -- 7.3.3 Revision in Łukasiewicz' Many-Valued Logic (Łn) -- 7.4 Revising in Algebraic Logics -- 7.4.1 Translating Algebraic Logic into Classical Logic -- 7.4.2 Revision in Algebraic Logics -- 7.5 Introducing Belnap's Four-Valued Logic -- 7.5.1 Belief Revision in Belnap's Four-Valued Logic -- 7.6 Belnap's Four-Valued Logic. , 7.6.1 Axiomatising Belnap's Four-Valued Logic -- 7.6.2 Entailment in Belnap's Four-Valued Logic -- 7.6.3 Generalising Belnap's Notion of Entailment to Infinite Theories -- 7.6.4 Translating Belnap's Logic into Classical Logic -- 7.6.5 Revising in Belnap's Four-Valued Logic -- 7.7 Conclusions and Discussions -- References -- 8 Object-Level Deletion -- 8.1 Introduction -- 8.2 Object-Level Meta-Level Operations -- 8.3 The Need for Object-Level Deletion -- 8.4 Strategy of the Technique -- 8.5 Substructural Logics -- 8.5.1 Hilbert and Gentzen Formulations -- 8.5.2 Goal-Directed Proof Theory -- 8.5.3 Semantics -- 8.6 Introducing Anti-formulae in Concatenation and Linear Logic -- 8.6.1 Analysis -- 8.6.2 Introducing Anti-formulae into Logics with and e -- 8.6.3 Anti-formulae and Negation -- 8.7 The Notion of Failure in Resource Logics -- 8.8 Deletion in Resource-Unbounded Logics -- 8.9 Logical Deletion in LDS -- 8.10 Introducing N-Prolog with Negation as Failure -- 8.11 Exploring Deletion via Addition -- 8.12 A Formal System for Deletion via Addition -- 8.13 Concluding Remarks -- References -- 9 Conclusions and Discussions -- 9.1 Concluding Remarks -- 9.2 Discussions -- References -- List of Symbols -- Subject Index.

Anmerkung: Intro -- Preface -- Contents -- 1 Introduction and Motivation -- Programme -- Short Overview of the Different Logics -- Nonmonotonic Logics -- Theory Revision -- Theory Update -- Deontic Logic -- Counterfactual Conditionals -- Modal Logic -- Intuitionistic Logic -- Inheritance Systems -- A Summarizing Table for the Semantics -- A Discussion of Concepts -- Basic Semantic Entities, Truth Values, and Operators -- Algebraic and Structural Semantics -- Restricted Operators and Relations -- Copies in Preferential Models -- Further Remarks on Universality of Representation Proofs -- in the Object Language? -- Various Considerations on Abstract Semantics -- A Comparison with Reiter Defaults -- IBRS -- Definition and Comments -- The Power of IBRS -- Abstract Semantics for IBRS and Its Engineering Realization -- 2 Basic Definitions and Results -- Algebraic Definitions -- Basic Logical Definitions -- Basic Definitions and Results for Nonmonotonic Logics -- 3 Abstract Semantics by Size -- The First-Order Setting -- General Size Semantics -- Introduction -- Main Table -- Coherent Systems -- Size and Principal Filter Logic -- 4 Preferential Structures -- Part I -- Introduction -- Remarks on Nonmonotonic Logics and Preferential Semantics -- Basic Definitions -- Preferential Structures Without Domain Conditions -- General Discussion -- Detailed Discussion -- 5 Preferential Structures -- Part II -- Simplifications by Domain Conditions, Logical Properties -- Introduction -- Smooth Structures -- Ranked Structures -- The Logical Properties with Definability Preservation -- A-Ranked Structures -- Representation Results for A-Ranked Structures -- Two-Sequent Calculi -- Introduction -- Plausibility Logic -- A Comment on the Work by Arieli and Avron -- Blurred Observation -- Absence of Definability Preservation -- Introduction. , General and Smooth Structures Without Definability Preservation -- Ranked Structures -- The Limit Variant -- Introduction -- The Algebraic Limit -- The Logical Limit -- 6 Higher Preferential Structures -- Introduction -- The General Case -- Discussion of the Totally Smooth Case -- The Essentially Smooth Case -- Translation to Logic -- 7 Deontic Logic and Hierarchical Conditionals -- Semantics of Deontic Logic -- Introductory Remarks -- Basic Definitions -- Philosophical Discussion of Obligations -- Examination of the Various Cases -- What Is An Obligation? -- Conclusion -- A Comment on Work by Aqvist -- Introduction -- There Are (At Least) Two Solutions -- Outline -- Gm A Implies G A (Outline) -- Hierarchical Conditionals -- Introduction -- Formal Modelling and Summary of Results -- Overview -- Connections with Other Concepts -- Formal Results and Representation for Hierarchical Conditionals -- 8 Theory Update and Theory Revision -- Update -- Introduction -- Hidden Dimensions -- Theory Revision -- Introduction to Theory Revision -- Booth Revision -- Revision and Independence -- Preferential Modelling of Defaults -- Remarks on Independence -- 9 An Analysis of Defeasible Inheritance Systems -- Introduction -- Terminology -- Inheritance and Reactive Diagrams -- Conceptual Analysis -- Introduction to Nonmonotonic Inheritance -- Basic Discussion -- Directly Sceptical Split Validity Upward Chaining Off-Path Inheritance -- Review of Other Approaches and Problems -- Defeasible Inheritance and Reactive Diagrams -- Summary of Our Algorithm -- Overview -- Compilation and Memorization -- Executing the Algorithm -- Signposts -- Beyond Inheritance -- Interpretations -- Introduction -- Informal Comparison of Inheritance with the Systems P and R -- Inheritance as Information Transfer -- Inheritance as Reasoning with Prototypes. , Detailed Translation of Inheritance to Modified Systems of Small Sets -- Normality -- Small Sets -- Bibliography -- Index.