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 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.