Switch to: Citations

Add references

You must login to add references.
  1. On Inferences from Inconsistent Premises.Nicholas Rescher & Ruth Manor - 1970 - Theory and Decision 1 (2):179-217, 1970-1971.
    The main object of this paper is to provide the logical machinery needed for a viable basis for talking of the ‘consequences’, the ‘content’, or of ‘equivalences’ between inconsistent sets of premisses.With reference to its maximal consistent subsets (m.c.s.), two kinds of ‘consequences’ of a propositional set S are defined. A proposition P is a weak consequence (W-consequence) of S if it is a logical consequence of at least one m.c.s. of S, and P is an inevitable consequence (I-consequence) of (...)
    Download  
     
    Export citation  
     
    Bookmark   77 citations  
  • Minimally inconsistent LP.Graham Priest - 1991 - Studia Logica 50 (2):321 - 331.
    The paper explains how a paraconsistent logician can appropriate all classical reasoning. This is to take consistency as a default assumption, and hence to work within those models of the theory at hand which are minimally inconsistent. The paper spells out the formal application of this strategy to one paraconsistent logic, first-order LP. (See, Ch. 5 of: G. Priest, In Contradiction, Nijhoff, 1987.) The result is a strong non-monotonic paraconsistent logic agreeing with classical logic in consistent situations. It is shown (...)
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • DA2 merging operators.S. Konieczny, J. Lang & P. Marquis - 2004 - Artificial Intelligence 157 (1-2):49-79.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Counterfactuals.Matthew L. Ginsberg - 1986 - Artificial Intelligence 30 (1):35-79.
    Download  
     
    Export citation  
     
    Bookmark   57 citations  
  • Semantic forgetting in answer set programming.Thomas Eiter & Kewen Wang - 2008 - Artificial Intelligence 172 (14):1644-1672.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the complexity of propositional knowledge base revision, updates, and counterfactuals.Thomas Eiter & Georg Gottlob - 1992 - Artificial Intelligence 57 (2-3):227-270.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Solving logic program conflict through strong and weak forgettings.Yan Zhang & Norman Y. Foo - 2006 - Artificial Intelligence 170 (8-9):739-778.
    Download  
     
    Export citation  
     
    Bookmark   7 citations