Switch to: Citations

Add references

You must login to add references.
  1. Semantics and complexity of recursive aggregates in answer set programming.Wolfgang Faber, Gerald Pfeifer & Nicola Leone - 2011 - Artificial Intelligence 175 (1):278-298.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • FLP answer set semantics without circular justifications for general logic programs.Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner & Jun Deng - 2014 - Artificial Intelligence 213 (C):1-41.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Stable models and circumscription.Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz - 2011 - Artificial Intelligence 175 (1):236-263.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs.Miroslaw Truszczyński - 2010 - Artificial Intelligence 174 (16-17):1285-1306.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Combining answer set programming with description logics for the Semantic Web.Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer & Hans Tompits - 2008 - Artificial Intelligence 172 (12-13):1495-1539.
    Download  
     
    Export citation  
     
    Bookmark   16 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