Relevance Sensitive Non-Monotonic Inference on Belief Sequences
From MaRDI portal
Publication:4443395
Abstract: We present a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two orderings: a temporal sequencing and an ordering based on relevance relations between the conclusion and formulas in the sequence. The relevance relations are ternary (using context as a parameter) as opposed to standard binary axiomatizations. The inference operation thus defined easily handles iterated revision by maintaining a revision history, blocks the derivation of inconsistent answers from a possibly inconsistent sequence and maintains the distinction between explicit and implicit beliefs. In doing so, it provides a finitely presented formalism and a plausible model of reasoning for automated agents.
Recommendations
- Relevance sensitive belief structures
- scientific article; zbMATH DE number 3514860
- Semantics-based nonmonotonic inference
- Nonmonotonic inference based on expectations
- On probabilistic representation of non-probabilistic belief revision
- Nonmonotonic reasoning with multiple belief sets
- Nonmonotonic reasoning with multiple belief sets
- scientific article; zbMATH DE number 4018167
- Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision
Cites work
- scientific article; zbMATH DE number 4166927 (Why is no real title available?)
- scientific article; zbMATH DE number 754675 (Why is no real title available?)
- Conditionals and monotonic belief revisions: The success postulate
- Cumulative default logic: In defense of nonmonotonic inference rules
- In defense of base contraction
- On the logic of iterated belief revision
- On the logic of theory change: Partial meet contraction and revision functions
- Propositional belief base update and minimal change
- Relevance sensitive belief structures
Cited in
(8)- Belief liberation (and retraction)
- Relevance sensitive belief structures
- Parikh and Wittgenstein
- Non-prioritized ranked belief change
- Relevance in belief revision
- On AGM for non-classical logics
- Parallel interpolation, splitting, and relevance in belief change
- Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision
This page was built for publication: Relevance Sensitive Non-Monotonic Inference on Belief Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443395)