A Model-Based Algorithm for Propositional Belief Revision

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 linear-time algorithm to decide Σ ⊢ Σ'. We adapt the previous algorithm to build a model-based proposal for belief re...

Full description

Saved in:
Bibliographic Details
Published inRevista IEEE América Latina Vol. 13; no. 4; pp. 1055 - 1060
Main Authors Zacarias, Fernando, De Ita, Guillermo
Format Journal Article
LanguageEnglish
Published Los Alamitos IEEE 01.04.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1548-0992
1548-0992
DOI10.1109/TLA.2015.7106357

Cover

More Information
Summary: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 linear-time algorithm to decide Σ ⊢ Σ'. We adapt the previous algorithm to build a model-based 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 NP-complete problems.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1548-0992
1548-0992
DOI:10.1109/TLA.2015.7106357