Switch to: Citations

Add references

You must login to add references.
  1. An optimal coarse-grained arc consistency algorithm.Christian Bessière, Jean-Charles Régin, Roland H. C. Yap & Yuanlin Zhang - 2005 - Artificial Intelligence 165 (2):165-185.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Locating the phase transition in binary constraint satisfaction problems.Barbara M. Smith & Martin E. Dyer - 1996 - Artificial Intelligence 81 (1-2):155-181.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
    Download  
     
    Export citation  
     
    Bookmark   108 citations  
  • An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
    Download  
     
    Export citation  
     
    Bookmark   13 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-6d5f778f9-c5swx uwo