Switch to: References

Add citations

You must login to add citations.
  1. A theoretical evaluation of selected backtracking algorithms.Grzegorz Kondrak & Peter van Beek - 1997 - Artificial Intelligence 89 (1-2):365-387.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning.Subbarao Kambhampati - 1998 - Artificial Intelligence 105 (1-2):161-208.
    Download  
     
    Export citation  
     
    Bookmark   3 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  
  • Binary vs. non-binary constraints☆☆This paper includes results that first appeared in [1,4,23]. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program. [REVIEW]Fahiem Bacchus, Xinguang Chen, Peter van Beek & Toby Walsh - 2002 - Artificial Intelligence 140 (1-2):1-37.
    Download  
     
    Export citation  
     
    Bookmark   3 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  
    		•
  • Concurrent search for distributed CSPs.Roie Zivan & Amnon Meisels - 2006 - Artificial Intelligence 170 (4-5):440-461.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Hybrid backtracking bounded by tree-decomposition of constraint networks.Philippe Jégou & Cyril Terrioux - 2003 - Artificial Intelligence 146 (1):43-75.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Backjumping for Quantified Boolean Logic satisfiability.Enrico Giunchiglia, Massimo Narizzano & Armando Tacchella - 2003 - Artificial Intelligence 145 (1-2):99-120.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Decomposable constraints☆☆Supported by EPSRC award GR/L/24014. The authors wish to thank other members of the APES research group.Ian Gent, Kostas Stergiou & Toby Walsh - 2000 - Artificial Intelligence 123 (1-2):133-156.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • On forward checking for non-binary constraint satisfaction.Christian Bessière, Pedro Meseguer, Eugene C. Freuder & Javier Larrosa - 2002 - Artificial Intelligence 141 (1-2):205-224.
    Download  
     
    Export citation  
     
    Bookmark   3 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-6f97f49787-r597v uwo