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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Autoepistemic answer set programming.Pedro Cabalar, Jorge Fandinno & Luis Fariñas del Cerro - 2020 - Artificial Intelligence 289 (C):103382.
    Download  
     
    Export citation  
     
    Bookmark  
  • Query inseparability for ALC ontologies.Elena Botoeva, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter & Michael Zakharyaschev - 2019 - Artificial Intelligence 272 (C):1-51.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms.Ringo Baumann & Hannes Strass - 2022 - Artificial Intelligence 305 (C):103680.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A progression semantics for first-order logic programs.Yi Zhou & Yan Zhang - 2017 - Artificial Intelligence 250 (C):58-79.
    Download  
     
    Export citation  
     
    Bookmark