2017
IJCAI
IJCAI 2017
Epistemic-entrenchment Characterization of Parikh’s Axiom
Abstract
In this article, we provide the epistemic-entrenchment characterization of the weak version of Parikh’s relevance-sensitive axiom for belief revision — known as axiom (P) — for the general case of incomplete theories. Loosely speaking, axiom (P) states that, if a belief set K can be divided into two disjoint compartments, and the new information φ relates only to the first compartment, then the second compartment should not be affected by the revision of K by φ. The above-mentioned characterization, essentially, constitutes additional constraints on epistemic-entrenchment preorders, that induce AGM revision functions, satisfying the weak version of Parikh’s axiom (P).
🧭
Keyword Pioneer
— agm postulate
🐣
Hot Topic Early Bird
— logical reasoning
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics