Belief Reasoning, Revision and Fusion by Matrix Algebra
Lecture notes in computer sciencePublished 1 January 2004
Churn‐Jung Liau
Citations9
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A matrix representation for ordered belief states is developed and it is shown that belief reasoning, revision and fusion can all be interpreted as operations of matrix algebra.
Abstract
Representation of belief states is an important issue forknowledge based systems. In this paper, we develop a matrix representation for ordered belief states and show that belief reasoning, revision and fusion can all be interpreted as operations of matrix algebra. Thus, the matrix representation can serve as the basis of algebraic semantics for belief logic.
Keywords
Computer Science
Journal of Symbolic LogicOn the logic of theory change: Partial meet contraction and revision functions
3,222 Citations1985Carlos E. Alchourrón, Peter Gärdenfors +1 more
The authors investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated, and basic properties of these functions are established.
The MIT Press eBooksReasoning About Knowledge
2,594 Citations1995Ronald Fagin, Joseph Y. Halpern +2 more
Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed systems, artificial intelligence, and game theory.
Ordinal Conditional Functions: A Dynamic Theory of Epistemic States
914 Citations1988Wolfgang Spohn
Cambridge University Press eBooksOn the difference between updating a knowledge base and revising it
863 Citations1992Hirofumi Katsuno, Alberto O. Mendelzon
Artificial IntelligenceA guide to completeness and complexity for modal logics of knowledge and belief
838 Citations1992Joseph Y. Halpern, Yoram Moses
It is shown that while the problem of deciding satisfiability of an S5 formula with one agent is NP-complete, the problem for many agents is PSPACE-complete and the problem becomes complete for exponential time once a common knowledge operator is added to the language.
Artificial IntelligencePropositional knowledge base revision and minimal change
796 Citations1991Hirofumi Katsuno, Alberto O. Mendelzon
The semantics of revising knowledge bases represented by sets of propositional sentences is analyzed from a model-theoretic point of view and all revision schemes that satisfy the Gardenfors rationality postulates are characterized.
Belief Revision
724 Citations2003Peter Gärdenfors, Hans Rott
Artificial IntelligenceOn the logic of iterated belief revision
656 Citations1997Adnan Darwiche, Judea Pearl
A model-based representation theorem is established which characterizes the augmented system of postulates and constrains, in turns, the way in which entrenchment orderings may be transformed under iterated belief revisions.
Lecture notes in computer scienceSymbolic and Quantitative Approaches to Reasoning and Uncertainty
628 Citations1993
Data fusion in the transferable belief model
308 Citations2000P. Smets
The author presents practical applications where the fusion of uncertain data is well achieved by Dempster's rule of combination, which is central in the transferable belief model whereas it hardly fits with the upper and lower probabilities theory.
Computational IntelligenceCOMBINING KNOWLEDGE BASES CONSISTING OF FIRST‐ORDER THEORIES
232 Citations1992Chitta Baral, Sarit Kraus +2 more
Studies in fuzziness and soft computingAggregation and Fusion of Imperfect Information
190 Citations1998Bernadette Bouchon‐Meunier
This work presents a generalized fuzzy clustering model based on aggregation operators and its applications, and proposes a new approach called Sato's model, which aims to provide a simple, scalable and scalable aggregating model for fuzzy rationality measures.
ACM Transactions on Database SystemsAmalgamating knowledge bases
186 Citations1994V. S. Subrahmanian
This paper presents a uniform theoretical framework, based on annotated logics, for amalgamating multiple knowledge bases when these knowledge bases may contain inconsistencies, uncertainties, and nonmonotonicmodes of negation.
Principles of Knowledge Representation and ReasoningTransmutations of Knowledge Systems
183 Citations1994Mary‐Anne Williams
This work defines a transmutation of a well-ordered system of spheres using ordinal conditional functions, and provides several conditions which capture the relationship between an Ordinal conditional function and an ordinal epistemic entrenchment function, and their corresponding transmutations.
International Joint Conference on Artificial IntelligenceRevision sequences and nested conditionals
162 Citations1993Craig Boutilier
The method of natural revision is described that ensures the preservation of conditional beliefs after revision by an objective belief, based on a simple modal logic for beliefs and conditionals and extends the AGM theory of belief revision to account for sentences of objective revisions of a belief set.
International Joint Conference on Artificial IntelligenceBelief revision, revised
155 Citations1995Daniel Lehmann
An altenative to the AGM framework for studying belief revision and probability postulates is proposed and Iterated revisions are the objects of this formalism and the rationality postulates deal with properties of iterated revisions.
Logic Journal of IGPLBelief Revision From the Point of View of Doxastic Logic
145 Citations1995Krister Segerberg
Maarten de Rijke's idea is taken further, addressing the question whether there is a particular doxastic or epistemic logic implicit in AGM.
Applied logic seriesKnowledge Base Merging by Majority
124 Citations1999Jinxin Lin, Alberto O. Mendelzon
Systems organized around reasoning agents face the similar problem of resolving conflicts among contradictory knowledge or beliefs1 held by different agents, and want to extract additional knowledge that is not locally held by any agent, but collectively by all of them.
Journal of the Royal Statistical Society Series C (Applied Statistics)Causation in Decision, Belief Change and Statistics.
122 Citations1990Simon French, William Harper +1 more
Cambridge University Press eBooksBelief change and possibility theory
121 Citations1992Didier Dubois, Henri Prade
Studies in fuzziness and soft computingFrom Semantic to Syntactic Approaches to Information Combination in Possibilistic Logic
67 Citations1998Salem Benferhat, Didier Dubois +1 more
S syntactic combination rules for merging uncertain propositional knowledge bases provided by different sources of information, in the framework of possibilistic logic, are proposed.
Possibility Theory in Information Fusion
60 Citations2001Didier Dubois, Henri Prade
Kluwer Academic Publishers eBooksDynamic Worlds: From the Frame Problems to Knowledge Management
43 Citations1999Remo Pareschi, B. Fronhhofer
This book comprises several contributions to current ways of approaching this problem and surveys and synthesizes recent research work, while on the other hand new research results are included.
Lecture notes in computer scienceAutomated reasoning with uncertainties
33 Citations1994Flávio S. Corrêa da Silva, Dave Robertson +1 more
In this work, a system for automated reasoning with multiple representations of uncertainty is presented and it is assumed that uncertainty is a multifaceted concept.
Generalized Update: Belief Change in Dynamic Settings
33 Citations1995Craig Boutilier
This model of update combines aspects of revision and update, providing a more realistic characterization of belief change, and formally verifies the intuition that revision is suitable for "static" belief change.
Lecture notes in computer scienceA logical approach to multi-sources reasoning
31 Citations1994Laurence Cholvy
It is shown that ordering the different sources according to their reliability is a good way for solving this problem and correspond to two attitudes one can take with respect to such an order.
ACM Transactions on Computational LogicA modal logic framework for multi-agent belief fusion
31 Citations2005Churn‐Jung Liau
A modal logic framework for reasoning about cautiously merged agent beliefs that have different degrees of reliability is provided by combining the multi-agent epistemic logic and multi-source reasoning systems.
Journal of Logic Language and InformationBelief Fusion: Aggregating Pedigreed Belief States
26 Citations2001Pedrito Maynard-Reid, Yoav Shoham
A new operator is introduced – belief fusion – which aggregates the beliefs of two agents, each informed by a subset of sources ranked by reliability, which definespedigreed belief states, which enrich standard belief states with the source of each piece of information.
Journal of Intelligent Information SystemsCombining databases with prioritized information
15 Citations1995Shekhar Pradhan, Jack Minker +1 more
This work constructs a framework within which the consequences of a set of such preferences (expressed as priorities among sets of statements) can be computed and gives four types of semantics for priorities, three of which are shown to be equivalent to one another.
A conservative approach to distributed belief fusion
14 Citations2000Churn-Jung Lian
Logics for merging beliefs of agents with different degrees of reliability are developed by combining the multiagent epistemic logic and multi-sources reasoning systems and every ordering for the reliability of the agents is represented by a modal operator.
arXiv (Cornell University)Representing and Aggregating Conflicting Beliefs
12 Citations2002Pedrito Maynard-Reid, Daniel Lehmann
Lecture notes in computer scienceEpistemic Logics for Information Fusion
2 Citations2003Churn‐Jung Liau
The fusion operators considered in this paper include majority merging, arbitration, and general merging are considered and some modalities corresponding to these fusion operators are added to epistemic logics and the Kripke semantics of these extended logics are presented.