Switch to: References

Add citations

You must login to add citations.
  1. Adaptive Logics for Defeasible Reasoning.Christian Straßer - 2014 - Springer.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Semantic characterization of rational closure: From propositional logic to description logics.L. Giordano, V. Gliozzi, N. Olivetti & G. L. Pozzato - 2015 - Artificial Intelligence 226 (C):1-33.
  • A reconstruction of multipreference closure.Laura Giordano & Valentina Gliozzi - 2021 - Artificial Intelligence 290 (C):103398.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Revision by Comparison.Eduardo Fermé & Hans Rott - 2004 - Artificial Intelligence 157 (1):5-47.
    Since the early 1980s, logical theories of belief revision have offered formal methods for the transformation of knowledge bases or “corpora” of data and beliefs. Early models have dealt with unconditional acceptance and integration of potentially belief-contravening pieces of information into the existing corpus. More recently, models of “non-prioritized” revision were proposed that allow the agent rationally to refuse to accept the new information. This paper introduces a refined method for changing beliefs by specifying constraints on the relative plausibility of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  • Situated conditional reasoning.Giovanni Casini, Thomas Meyer & Ivan Varzinczak - 2023 - Artificial Intelligence 319 (C):103917.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • On rational entailment for Propositional Typicality Logic.Richard Booth, Giovanni Casini, Thomas Meyer & Ivan Varzinczak - 2019 - Artificial Intelligence 277 (C):103178.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • From iterated revision to iterated contraction: Extending the Harper Identity.Richard Booth & Jake Chandler - 2019 - Artificial Intelligence 277 (C):103171.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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