Switch to: Citations

Add references

You must login to add references.
  1. Parameterized Complexity.R. G. Downey & M. R. Fellows - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints.Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan & Toby Walsh - 2009 - Artificial Intelligence 173 (11):1054-1078.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
    Download  
     
    Export citation  
     
    Bookmark   73 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  
  • Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference.J. Pearl, F. Bacchus, P. Spirtes, C. Glymour & R. Scheines - 1988 - Synthese 104 (1):161-176.
    Download  
     
    Export citation  
     
    Bookmark   244 citations  
  • (1 other version)The Decision Problem for a Class of First-Order Formulas in Which all Disjunctions are Binary.M. R. Krom - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):15-20.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • (1 other version)The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary.M. R. Krom - 1967 - Mathematical Logic Quarterly 13 (1‐2):15-20.
    Download  
     
    Export citation  
     
    Bookmark   9 citations