Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Preferential Accessibility and Preferred Worlds.Katarina Britz & Ivan Varzinczak - 2018 - Journal of Logic, Language and Information 27 (2):133-155.
    Modal accounts of normality in non-monotonic reasoning traditionally have an underlying semantics based on a notion of preference amongst worlds. In this paper, we motivate and investigate an alternative semantics, based on ordered accessibility relations in Kripke frames. The underlying intuition is that some world tuples may be seen as more normal, while others may be seen as more exceptional. We show that this delivers an elegant and intuitive semantic construction, which gives a new perspective on defeasible necessity. Technically, the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • A Note on a Description Logic of Concept and Role Typicality for Defeasible Reasoning Over Ontologies.Ivan Varzinczak - 2018 - Logica Universalis 12 (3-4):297-325.
    In this work, we propose a meaningful extension of description logics for non-monotonic reasoning. We introduce \, a logic allowing for the representation of and reasoning about both typical class-membership and typical instances of a relation. We propose a preferential semantics for \ in terms of partially-ordered DL interpretations which intuitively captures the notions of typicality we are interested in. We define a tableau-based algorithm for checking \ knowledge-base consistency that always terminates and we show that it is sound and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation