Switch to: References

Add citations

You must login to add citations.
  1. Expressiveness and definability in circumscription.Francicleber Martins Ferreira & Ana Teresa Martins - 2011 - Manuscrito 34 (1):233-266.
    We investigate expressiveness and definability issues with respect to minimal models, particularly in the scope of Circumscription. First, we give a proof of the failure of the Löwenheim-Skolem Theorem for Circumscription. Then we show that, if the class of P; Z-minimal models of a first-order sentence is Δ-elementary, then it is elementary. That is, whenever the circumscription of a first-order sentence is equivalent to a first-order theory, then it is equivalent to a finitely axiomatizable one. This means that classes of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • The complexity of predicate default logic over a countable domain.Robert Saxon Milnikel - 2003 - Annals of Pure and Applied Logic 120 (1-3):151-163.
    Lifschitz introduced the notion of defining extensions of predicate default theories not as absolute, but relative to a specified domain. We look specifically at default theories over a countable domain and show the set of default theories which possess an ω -extension is Σ 2 1 -complete. That the set is in Σ 2 1 is shown by writing a nearly circumscriptive formula whose ω -models correspond to the ω -extensions of a given default theory; similarly, Σ 2 1 -hardness (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Is intractability of nonmonotonic reasoning a real drawback?Marco Cadoli, Francesco M. Donini & Marco Schaerf - 1996 - Artificial Intelligence 88 (1-2):215-251.
    Download  
     
    Export citation  
     
    Bookmark   4 citations