Switch to: References

Citations of:

Extending the Harper Identity to Iterated Belief Change

In Subbarao Kambhampati (ed.), Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). Palo Alto, USA: AAAI Press / International Joint Conferences on Artificial Intelligence (2016)

Add citations

You must login to add citations.
  1. Belief Revision and Computational Argumentation: A Critical Comparison.Pietro Baroni, Eduardo Fermé, Massimiliano Giacomin & Guillermo Ricardo Simari - 2022 - Journal of Logic, Language and Information 31 (4):555-589.
    This paper aims at comparing and relating belief revision and argumentation as approaches to model reasoning processes. Referring to some prominent literature references in both fields, we will discuss their (implicit or explicit) assumptions on the modeled processes and hence commonalities and differences in the forms of reasoning they are suitable to deal with. The intended contribution is on one hand assessing the (not fully explored yet) relationships between two lively research fields in the broad area of defeasible reasoning and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Elementary Iterated Revision and the Levi Identity.Jake Chandler & Richard Booth - forthcoming - In Proceedings of the 7th International Conference on Logic, Rationality and Interaction (LORI 2019).
    Recent work has considered the problem of extending to the case of iterated belief change the so-called `Harper Identity' (HI), which defines single-shot contraction in terms of single-shot revision. The present paper considers the prospects of providing a similar extension of the Levi Identity (LI), in which the direction of definition runs the other way. We restrict our attention here to the three classic iterated revision operators--natural, restrained and lexicographic, for which we provide here the first collective characterisation in the (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  • How to construct Remainder Sets for Paraconsistent Revisions: Preliminary Report.Rafael Testa, Eduardo Fermé, Marco Garapa & Maurício Reis - 2018 - 17th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING.
    Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation