Switch to: Citations

Add references

You must login to add references.
  1. Conflict-driven answer set solving: From theory to practice.Martin Gebser, Benjamin Kaufmann & Torsten Schaub - 2012 - Artificial Intelligence 187-188 (C):52-89.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • ASSAT: computing answer sets of a logic program by SAT solvers.Fangzhen Lin & Yuting Zhao - 2004 - Artificial Intelligence 157 (1-2):115-137.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Computational properties of argument systems satisfying graph-theoretic constraints.Paul E. Dunne - 2007 - Artificial Intelligence 171 (10-15):701-729.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Extending and implementing the stable model semantics.Patrik Simons, Ilkka Niemelä & Timo Soininen - 2002 - Artificial Intelligence 138 (1-2):181-234.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Local search with edge weighting and configuration checking heuristics for minimum vertex cover.Shaowei Cai, Kaile Su & Abdul Sattar - 2011 - Artificial Intelligence 175 (9-10):1672-1696.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Guarantees and limits of preprocessing in constraint satisfaction and reasoning.Serge Gaspers & Stefan Szeider - 2014 - Artificial Intelligence 216 (C):1-19.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Bounded treewidth as a key to tractability of knowledge representation and reasoning.Georg Gottlob, Reinhard Pichler & Fang Wei - 2010 - Artificial Intelligence 174 (1):105-132.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Augmenting tractable fragments of abstract argumentation.Wolfgang Dvořák, Sebastian Ordyniak & Stefan Szeider - 2012 - Artificial Intelligence 186 (C):157-173.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (3 other versions)Parameterized Complexity Theory.J. Flum - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Parameterized Complexity.R. G. Downey & M. R. Fellows - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • On the impact of stratification on the complexity of nonmonotonic reasoning.Ilkka Niemelä & Jussi Rintanen - 1994 - Journal of Applied Non-Classical Logics 4 (2):141-179.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Fixed-parameter complexity in AI and nonmonotonic reasoning.Georg Gottlob, Francesco Scarcello & Martha Sideri - 2002 - Artificial Intelligence 138 (1-2):55-86.
    Download  
     
    Export citation  
     
    Bookmark   11 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-6f97f49787-hdzht uwo