Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Dalal's Revision without Hamming Distance

Abstract : A well known strategy for belief revision is the use of an operator which takes as input a belief base and formula and outputs a new consistent revised belief base. Many operators require additional information such as epistemic entrenchment relations, system of spheres, faithful orderings, subformulae relation, etc. However, in many applications this extra information does not exist and all beliefs have to be equally considered. Other operators that can do without background information are dependent on the syntax. Among the few operators that possess both kinds of independence: of extra information and of the syntax, Dalal’s operator is the most outstanding. Dalal’s revision moves from the models of the base to the models of the input formula which are closest in terms of Hamming distance. A drawback of Dalal’s approach is that it fails when faced with inconsistent belief bases. This paper proposes a new method for computing Dalal’s revision that avoids the computation of belief bases models. We propose a new distance between formulae based on distances between terms of formulae in DNF and a revision operator based on these distances. The proposed operator produces Dalal’s equivalent results when the belief base and new input are both consistent. Moreover, this new operator is able to handle inconsistent belief bases. We also analyze several properties of the new operator. While the input belief base and formula need a compilation to DNF, the operator meets desirable properties making the approach suitable for implementation.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Monday, July 20, 2015 - 1:33:56 PM
Last modification on : Monday, July 4, 2022 - 9:46:43 AM
Long-term archiving on: : Wednesday, October 21, 2015 - 10:48:42 AM


Files produced by the author(s)


  • HAL Id : hal-01178556, version 1
  • OATAO : 13126


Pilar Pozos Parra, Weiru Liu, Laurent Perrussel. Dalal's Revision without Hamming Distance. 12th Mexican International Conference on Artificial Intelligence (MICAI 2013), Nov 2013, Mexico City, Mexico. pp. 41-53. ⟨hal-01178556⟩



Record views


Files downloads