Switch to: Citations

Add references

You must login to add references.
  1. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems.Alan K. Mackworth & Eugene C. Freuder - 1985 - Artificial Intelligence 25 (1):65-74.
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • Arc and path consistency revisited.Roger Mohr & Thomas C. Henderson - 1986 - Artificial Intelligence 28 (2):225-233.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
    Download  
     
    Export citation  
     
    Bookmark   109 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  
    • 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-6b65f85844-t9k8j uwo