Switch to: Citations

Add references

You must login to add references.
  1. Refining the phase transition in combinatorial search.Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):127-154.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Decomposing constraint satisfaction problems using database techniques.Marc Gyssens, Peter G. Jeavons & David A. Cohen - 1994 - Artificial Intelligence 66 (1):57-89.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • An assumption-based TMS.Johan de Kleer - 1986 - Artificial Intelligence 28 (2):127-162.
    Download  
     
    Export citation  
     
    Bookmark   97 citations  
  • Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Experimental evaluation of preprocessing algorithms for constraint satisfaction problems.Rina Dechter & Itay Meiri - 1994 - Artificial Intelligence 68 (2):211-241.
    Download  
     
    Export citation  
     
    Bookmark   8 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-76d885d765-crb2p uwo