Switch to: Citations

Add references

You must login to add references.
  1. A logic for default reasoning.Ray Reiter - 1980 - Artificial Intelligence 13 (1-2):81-137.
    Download  
     
    Export citation  
     
    Bookmark   634 citations  
  • Reasoning on UML class diagrams.Daniela Berardi, Diego Calvanese & Giuseppe De Giacomo - 2005 - Artificial Intelligence 168 (1-2):70-118.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • A logical framework for default reasoning.David Poole - 1988 - Artificial Intelligence 36 (1):27-47.
    Download  
     
    Export citation  
     
    Bookmark   104 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  
  • Complexity of the two-variable fragment with counting quantifiers.Ian Pratt-Hartmann - 2005 - Journal of Logic, Language and Information 14 (3):369-395.
    The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Combining Horn rules and description logics in CARIN.Alon Y. Levy & Marie-Christine Rousset - 1998 - Artificial Intelligence 104 (1-2):165-209.
    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-5cf77db6b5-cjwxs uwo