Switch to: References

Add citations

You must login to add citations.
  1. 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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Prolog technology for default reasoning: proof theory and compilation techniques.Torsten Schaub & Stefan Brüning - 1998 - Artificial Intelligence 106 (1):1-75.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Reducing belief revision to circumscription.Paolo Liberatore & Marco Schaerf - 1997 - Artificial Intelligence 93 (1-2):261-296.
  • Reconsideration of circumscriptive induction with pointwise circumscription.Koji Iwanuma, Katsumi Inoue & Hidetomo Nabeshima - 2009 - Journal of Applied Logic 7 (3):307-317.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • An extension of pointwise circumscription.Koji Iwanuma & Kazuhiko Oota - 1996 - Artificial Intelligence 86 (2):391-402.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Linear resolution for consequence finding.Katsumi Inoue - 1992 - Artificial Intelligence 56 (2-3):301-353.
  • On the relationship between circumscription and negation as failure.Michael Gelfond, Halina Przymusinska & Teodor Przymusinski - 1989 - Artificial Intelligence 38 (1):75-94.
  • On the complexity of propositional knowledge base revision, updates, and counterfactuals.Thomas Eiter & Georg Gottlob - 1992 - Artificial Intelligence 57 (2-3):227-270.
  • First order LUB approximations: characterization and algorithms.Alvaro del Val - 2005 - Artificial Intelligence 162 (1-2):7-48.
    Direct download (2 more)  
     
    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.