Belief Revision: A Vade-Mecum

@inproceedings{Grdenfors1992BeliefRA,
  title={Belief Revision: A Vade-Mecum},
  author={Peter G{\"a}rdenfors},
  booktitle={META},
  year={1992}
}
This paper contains a brief survey of the area of belief revision and its relation to updating of logical databases as it has developed during the last years. A set of rationality postulates for revisions are presented. A couple of semi-algorithmic models of revision and updating are introduced. The models are connected to the postulates via some representation theorems. Finally, the relation between belief revision and nonmonotonic logic is explored. 
A Syntactic Possibilistic Belief Change Operator for Cognitive Agents
  • C. Pereira, A. Tettamanzi
  • Computer Science
    2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology
  • 2011
TLDR
The equivalence of the semantic and syntactic operators is proved and a syntactic possibilistic belief-change operator is proposed, which operates on a belief base represented as a fuzzy set of formulas.
Belief Revision And Epistemology
TLDR
It is argued that there is no way to repair the definitions of belief revision so as to retain the spirit of those theory, and belief revision is better studied from within an independently motivated epistemological theory.
A syntactic possibilistic belief change operator: Theory and empirical study
TLDR
The equivalence of the semantic and syntactic operators is proved and it is demonstrated that the cost of belief revision expressed in terms of the number of entailment checks required as well as the size of the belief base do not explode as thenumber of new pieces of information formulas supplied increases.
On the Use of Matrices for Belief Revision
TLDR
A new, more expressive representation of propositional expressions is introduced, which uses 2-dimensional complex matrices to store knowledge and can be exploited for devising a solution to the problem of belief revision.
Meta-reasoning: A Survey
  • S. Costantini
  • Computer Science
    Computational Logic: Logic Programming and Beyond
  • 2002
TLDR
The basic principles and possible applications of systems capable of meta-reasoning and reflection are presented, and the basic underlying semantic principles are reviewed.
A framework for reasoning under uncertainty based on non-deterministic distance semantics
Goal Generation and Adoption from Partially Trusted Beliefs
TLDR
A non-conventional approach for adopting goals is proposed which takes the degree of trust in the sources of information into account and two algorithms for updating the mental state of an agent in this new setting are proposed.
Some approaches to Belief Bases Merge
TLDR
Some non-prioritized merge operators, that is, operators for the consistent union of belief bases, are proposed and it is proposed that the formulated operators can be used in some multi-agent systems.
A Formalization of CK Design Theory Based on Intuitionist Logic
TLDR
The paper introduces a formalization of Concept-Knowledge theory of design reasoning based on Intuitionist Logic and Kripke type semantics to model the progressive elaboration of the concept space, the expansion of the knowledge and the interaction of concepts and knowledge.
Belief-Goal Relationships in Possibilistic Goal Generation
TLDR
A formalization of a possibilistic extension of Bratman's asymmetry thesis to hold between goals and beliefs is proposed and it is shown that the formalism avoids the side-effect and the transference problems.
...
...

References

SHOWING 1-10 OF 18 REFERENCES
Relations between the logic of theory change and nonmonotonic logic
The purpose of this paper is to investigate the close relations between the logic of theory change (alias belief revision) on the one hand, and nonmonotonic logic on the other. The connection is most
A Logic for Default Reasoning
  • R. Reiter
  • Philosophy, Computer Science
    Artif. Intell.
  • 1980
Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems
  • D. Gabbay
  • Computer Science
    Logics and Models of Concurrent Systems
  • 1984
TLDR
Inference mechanism to extract more information out of P, a set of propositions of predicate logic, which is a collection of confirmed data items.
A Logical Framework for Default Reasoning
  • D. Poole
  • Computer Science, Philosophy
    Artif. Intell.
  • 1988
Probabilistic reasoning in intelligent systems
On the Logic of Theory Change: Partial Meet Contraction and Revision Functions
TLDR
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.
Probabilistic reasoning
TLDR
This article shows that people rely on a limited number of heuristic principles which reduce the complex tasks of assessing probabilities and predicting values to simpler judgmental operations.
Logics and Models of Concurrent Systems
  • K. Apt
  • Computer Science
    NATO ASI Series
  • 1985
TLDR
A logic for the specification and proof of controllable processes of CCS and specification-oriented programming in TCSP and the theory of knowledge and ignorance in expert systems.
The Logic of Theory Change
TLDR
The logic of theory change is one of the literary work in this world in suitable to be reading material and this book gives reference, but also it will show the amazing benefits of reading a book.
...
...