Name
Abstract | ||
|---|---|---|
Parikh's relevance-sensitive axiom (P) for belief revision is open to two different interpretations, i.e. the weak and the strong version of (P), both of which are plausible depending on the context. Given that strong (P) has not received the attention it deserves, in this article, an extended examination of it is conducted. In particular, we point out interesting properties of the semantic characterization of the strong version of (P), as well as a vital feature of it that, potentially, results in a significant drop on the resources required for an implementation of a belief-revision system. Lastly, we shed light on the natural connection between global and local revision functions, via their corresponding semantic characterization, hence, a means for constructing global revision functions from local ones, and vice versa, is provided. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1093/logcom/exaa029 | JOURNAL OF LOGIC AND COMPUTATION |
Keywords | DocType | Volume |
Belief revision,relevance,Parikh's axiom,global and local revision,knowledge representation,reasoning | Journal | 30 |
Issue | ISSN | Citations |
5 | 0955-792X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Theofanis Aravanis | 1 | 2 | 2.44 |
| Pavlos Peppas | 2 | 265 | 31.74 |
| Mary-anne Williams | 3 | 953 | 128.61 |