Switch to: References

Add citations

You must login to add citations.
  1. A general model and thresholds for random constraint satisfaction problems.Yun Fan, Jing Shen & Ke Xu - 2012 - Artificial Intelligence 193 (C):1-17.
    Download  
     
    Export citation  
     
    Bookmark  
  • On the phase transitions of random k-constraint satisfaction problems.Yun Fan & Jing Shen - 2011 - Artificial Intelligence 175 (3-4):914-927.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Backtracking algorithms for disjunctions of temporal constraints.Kostas Stergiou & Manolis Koubarakis - 2000 - Artificial Intelligence 120 (1):81-117.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard.Bernd S. W. Schröder - 2001 - Artificial Intelligence 132 (1):105-117.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • A Lagrangian reconstruction of GENET.Kenneth M. F. Choi, Jimmy H. M. Lee & Peter J. Stuckey - 2000 - Artificial Intelligence 123 (1-2):1-39.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • Random constraint satisfaction: Easy generation of hard (satisfiable) instances.Ke Xu, Frédéric Boussemart, Fred Hemery & Christophe Lecoutre - 2007 - Artificial Intelligence 171 (8-9):514-534.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Reasoning from last conflict(s) in constraint programming.Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary & Vincent Vidal - 2009 - Artificial Intelligence 173 (18):1592-1614.
    Download  
     
    Export citation  
     
    Bookmark   4 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  
  • Concurrent search for distributed CSPs.Roie Zivan & Amnon Meisels - 2006 - Artificial Intelligence 170 (4-5):440-461.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modelling and solving temporal reasoning as propositional satisfiability.Duc Nghia Pham, John Thornton & Abdul Sattar - 2008 - Artificial Intelligence 172 (15):1752-1782.
    Download  
     
    Export citation  
     
    Bookmark   2 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-5d8df9484f-9zwsp uwo