Switch to: References

Add citations

You must login to add citations.
  1. Reducing belief revision to circumscription.Paolo Liberatore & Marco Schaerf - 1997 - Artificial Intelligence 93 (1-2):261-296.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Linear resolution for consequence finding.Katsumi Inoue - 1992 - Artificial Intelligence 56 (2-3):301-353.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • An extension of pointwise circumscription.Koji Iwanuma & Kazuhiko Oota - 1996 - Artificial Intelligence 86 (2):391-402.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Compiling specificity into approaches to nonmonotonic reasoning.James P. Delgrande & Torsten H. Schaub - 1997 - Artificial Intelligence 90 (1-2):301-348.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Prolog technology for default reasoning: proof theory and compilation techniques.Torsten Schaub & Stefan Brüning - 1998 - Artificial Intelligence 106 (1):1-75.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An efficient method for eliminating varying predicates from a circumscription.Marco Cadoli, Thomas Eiter & Georg Gottlob - 1992 - Artificial Intelligence 54 (3):397-410.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • How to reason defeasibly.John L. Pollock - 1992 - Artificial Intelligence 57 (1):1-42.
    Download  
     
    Export citation  
     
    Bookmark   60 citations  
  • An abstract, argumentation-theoretic approach to default reasoning.A. Bondarenko, P. M. Dung, R. A. Kowalski & F. Toni - 1997 - Artificial Intelligence 93 (1-2):63-101.
    Download  
     
    Export citation  
     
    Bookmark   106 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  
  • Embedding Logics in the Local Computation Framework.Nic Wilson & Jérôme Mengin - 2001 - Journal of Applied Non-Classical Logics 11 (3):239-267.
    The Local Computation Framework has been used to improve the efficiency of computation in various uncertainty formalisms. This paper shows how the framework can be used for the computation of logical deduction in two different ways; the first way involves embedding model structures in the framework; the second, and more direct, way involves embedding sets of formulae. This work can be applied to many of the logics developed for different kinds of reasoning, including predicate calculus, modal logics, possibilistic logics, probabilistic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Sound and efficient closed-world reasoning for planning.Oren Etzioni, Keith Golden & Daniel S. Weld - 1997 - Artificial Intelligence 89 (1-2):113-148.
    Download  
     
    Export citation  
     
    Bookmark   4 citations