Switch to: Citations

Add references

You must login to add references.
  1. Negation as failure.Michael Gelfond & Halina Przymusinska - 1986 - Artificial Intelligence 30 (3):273-287.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)On sentences which are true of direct unions of algebras.Alfred Horn - 1951 - Journal of Symbolic Logic 16 (1):14-21.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Structure identification in relational data.Rina Dechter & Judea Pearl - 1992 - Artificial Intelligence 58 (1-3):237-270.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • (1 other version)The decision problem for some classes of sentences without quantifiers.J. C. C. McKinsey - 1943 - Journal of Symbolic Logic 8 (2):61-76.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • On the relationship between circumscription and negation as failure.Michael Gelfond, Halina Przymusinska & Teodor Przymusinski - 1989 - Artificial Intelligence 38 (1):75-94.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • The decision problem for formulas in prenex conjunctive normal form with binary disjunctions.M. R. Krom - 1970 - Journal of Symbolic Logic 35 (2):210-216.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Reasoning under inconsistency: A forgetting-based approach.Jérôme Lang & Pierre Marquis - 2010 - Artificial Intelligence 174 (12-13):799-823.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6f9648bdd6-6d7m4 uwo