Switch to: References

Add citations

You must login to add citations.
  1. On the power of structural decompositions of graph-based representations of constraint problems.Gianluigi Greco & Francesco Scarcello - 2010 - Artificial Intelligence 174 (5-6):382-409.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Domain permutation reduction for constraint satisfaction problems.Martin J. Green & David A. Cohen - 2008 - Artificial Intelligence 172 (8-9):1094-1118.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • On minimal constraint networks.Georg Gottlob - 2012 - Artificial Intelligence 191-192 (C):42-60.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A comparison of structural CSP decomposition methods.Georg Gottlob, Nicola Leone & Francesco Scarcello - 2000 - Artificial Intelligence 124 (2):243-282.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Characterising tractable constraints.Martin C. Cooper, David A. Cohen & Peter G. Jeavons - 1994 - Artificial Intelligence 65 (2):347-361.
    Download  
     
    Export citation  
     
    Bookmark   5 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-fbfkv uwo