Results 231 to 240 of about 30,392 (251)
Some of the next articles are maybe not open access.
Applications of belief revision
1998Belief revision provides support for intelligent information processing and deci sion making The objective of this paper is to illustrate how theoretical ideas in belief revision have laid the foundation for practical implementations and real world applications Belief revision operators are often based on one of the following constructive de nitions an
openaire +1 more source
Controlled Revision - An Algorithmic Approach for Belief Revision
Journal of Logic and Computation, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gabbay, D, Pigozzi, G, Woods, J
openaire +2 more sources
1987
The efficiency of general belief revision techniques like the TMS or the ATMS decreases rapidly with the size and connectivity of the knowledge base and they are not designed for integrating non-monotonic and probabilistic evidence. Our belief revision algorithm ITMS overcomes these shortcomings by exploiting peculiarities of diagnostic reasoning.
openaire +1 more source
The efficiency of general belief revision techniques like the TMS or the ATMS decreases rapidly with the size and connectivity of the knowledge base and they are not designed for integrating non-monotonic and probabilistic evidence. Our belief revision algorithm ITMS overcomes these shortcomings by exploiting peculiarities of diagnostic reasoning.
openaire +1 more source
A Conditional Logic for Belief Revision
1998In this paper we introduce a conditional logic BC to represent belief revision. Logic BC has a standard semantics in terms of possible worlds structures with a selection function and has strong similarities with Stalnaker's logic C2. Moreover, Gardenfors' Triviality Result does not apply to BC.
V. GLIOZZI, GIORDANO, Laura, N. OLIVETTI
openaire +2 more sources
The Rôle of Language In Belief Revision
Studia Logica, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Subtler Belief Revision Policies
2017This paper proposes three subtle revision policies that are not propositionally successful (after a single application the agent might not believe the given propositional formula), but nevertheless are not propositionally idempotent (further applications might affect the agent’s epistemic state).
openaire +3 more sources
Dynamic logic for belief revision
Journal of Applied Non-Classical Logics, 2007Johan Van Benthem
exaly
Dynamic belief revision operators
Artificial Intelligence, 2003Maurice Pagnucco, Pavlos Peppas
exaly
Explanations, belief revision and defeasible reasoning
Artificial Intelligence, 2002Guillermo Ricardo Simari +1 more
exaly

