Un algoritmo basado en modelos para la revisión de creencias proposicional
(A ModelBased Algorithm for Propositional Belief Revision)
Fernando Zacarias (fzflores@yahoo.com.mx), Guillermo De Ita (deita@cs.buap.mx)
Universidad Autonoma de Puebla
This paper appears in: Revista IEEE América Latina
Publication Date: April 2015
Volume: 13, Issue: 4
ISSN: 15480992
Abstract:
Propositional Inference and belief revision are quite relevant to Automatic Reasoning. Given a KB Σ in DF and new information Σ' in CF, we show a deterministic and complete lineartime algorithm to decide
Σ ⊢ Σ'.
We adapt the previous algorithm to build a modelbased proposal for belief revision: Σ' = Σ ∘ P. Our proposal is based on Dalal's method of building a new DF Σ' consistent with p and whose models have the property to hold minimum changes with models of the original KB Σ. We show that, in the worst case, our proposal of belief revision involves the solution of satisfiability instances formed by subformulas of p, which implies the solution of NPcomplete problems.
Index Terms:
Automated Reasoning, Propositional Inference, Belief Revision, ModelBased Procedures
Documents that cite this
document
This function is not implemented yet.
[PDF FullText (471)]
