Resumo

ITA LUNA, Guillermo De; ZACARIAS FLORES, Fernando  e  GARCIA GARCIA, Alma Delia. Model-based Algorithm for Belief Revisions between Normal. Conjunctive Forms. Comp. y Sist. [online]. 2017, vol.21, n.3, pp.435-448. ISSN 2007-9737.  https://doi.org/10.13053/cys-21-3-2442.

Belief revision is a central area in knowledge representation and processing of automated reasoning. We will consider a knowledge base (KB) K and a new information φ, both expressed in conjunctive form (CF). We present here, a novel, deterministic and correct algorithm for belief revision of φ in K. We denote our revision operator as: K′ = K ◦ φ. We introduce a new logical binary operator Ind between two conjunctive forms, such that Ind(φ, K) generates also a conjunctive form. The operator Ind(φ, K) works building independent clauses with the clauses of K, and whose falsifying assignments of the resulting formula cover exactly the space of assignments F als(φ) − F als(K), this is essential for performing the process of belief revision K′ = K ◦ φ, where K′ ⊨ φ. Furthermore, our proposal satisfies the KM postulates. We also present the correctness proof of our belief revision method, and the analysis of its time complexity.

Palavras-chave : Propositional inference; belief revision; model based inference; postulates KM.