Switch to: References

Add citations

You must login to add citations.
  1. Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • A generic arc-consistency algorithm and its specializations.Pascal Van Hentenryck, Yves Deville & Choh-Man Teng - 1992 - Artificial Intelligence 57 (2-3):291-321.
  • No more “Partial” and “Full Looking Ahead”.Edward Tsang - 1998 - Artificial Intelligence 98 (1-2):351-361.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Investigating production system representations for non-combinatorial match.Milind Tambe & Paul S. Rosenbloom - 1994 - Artificial Intelligence 68 (1):155-199.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Backtracking algorithms for disjunctions of temporal constraints.Kostas Stergiou & Manolis Koubarakis - 2000 - Artificial Intelligence 120 (1):81-117.
  • Locating the phase transition in binary constraint satisfaction problems.Barbara M. Smith & Martin E. Dyer - 1996 - Artificial Intelligence 81 (1-2):155-181.
  • Tractable reasoning via approximation.Marco Schaerf & Marco Cadoli - 1995 - Artificial Intelligence 74 (2):249-310.
  • Processing disjunctions in temporal constraint networks.Eddie Schwalb & Rina Dechter - 1997 - Artificial Intelligence 93 (1-2):29-61.
  • Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem.Norman Sadeh & Mark S. Fox - 1996 - Artificial Intelligence 86 (1):1-41.
  • Backtracking techniques for the job shop scheduling constraint satisfaction problem.Norman Sadeh, Katia Sycara & Yalin Xiong - 1995 - Artificial Intelligence 76 (1-2):455-480.
  • On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
  • Constraint relaxation may be perfect.Ugo Montanari & Francesca Rossi - 1991 - Artificial Intelligence 48 (2):143-170.
  • Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems.Steven Minton, Mark D. Johnston, Andrew B. Philips & Philip Laird - 1992 - Artificial Intelligence 58 (1-3):161-205.
  • Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering.Ole J. Mengshoel, David C. Wilkins & Dan Roth - 2006 - Artificial Intelligence 170 (16-17):1137-1174.
  • Uncovering trees in constraint networks.Itay Meiri, Rina Dechter & Judea Pearl - 1996 - Artificial Intelligence 86 (2):245-267.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • The complexity of constraint satisfaction revisited.Alan K. Mackworth & Eugene C. Freuder - 1993 - Artificial Intelligence 59 (1-2):57-62.
  • Problem solving by searching for models with a theorem prover.Shie-Jue Lee & David A. Plaisted - 1994 - Artificial Intelligence 69 (1-2):205-233.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Maintaining reversible DAC for Max-CSP.Javier Larrosa, Pedro Meseguer & Thomas Schiex - 1999 - Artificial Intelligence 107 (1):149-163.
  • Querying temporal and spatial constraint networks in PTIME☆☆A preliminary version of this paper appeared in the proceedings of AAAI-99. A different version of this paper (aimed at a database audience) appeared in the proceedings of the workshop STDBM99. [REVIEW]Manolis Koubarakis & Spiros Skiadopoulos - 2000 - Artificial Intelligence 123 (1-2):223-263.
  • Semiring induced valuation algebras: Exact and approximate local computation algorithms.J. Kohlas & N. Wilson - 2008 - Artificial Intelligence 172 (11):1360-1399.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Unifying tree decompositions for reasoning in graphical models.Kalev Kask, Rina Dechter, Javier Larrosa & Avi Dechter - 2005 - Artificial Intelligence 166 (1-2):165-193.
  • Local consistency in parallel constraint satisfaction networks.Simon Kasif & Arthur L. Delcher - 1994 - Artificial Intelligence 69 (1-2):307-327.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • A general scheme for automatic generation of search heuristics from specification dependencies☆☆preliminary versions of this paper were presented in [15,16,18]. This work was supported in part by nsf grant iis-0086529 and by muri onr award n00014-00-1-0617. [REVIEW]Kalev Kask & Rina Dechter - 2001 - Artificial Intelligence 129 (1-2):91-131.
  • Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
  • Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.
  • Constraint reasoning based on interval arithmetic: the tolerance propagation approach.Eero Hyvönen - 1992 - Artificial Intelligence 58 (1-3):71-112.
  • Decomposing constraint satisfaction problems using database techniques.Marc Gyssens, Peter G. Jeavons & David A. Cohen - 1994 - Artificial Intelligence 66 (1):57-89.
  • Some fundamental properties of local constraint propagation.Hans-Werner Güsgen & Joachim Hertzberg - 1988 - Artificial Intelligence 36 (2):237-247.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Domain permutation reduction for constraint satisfaction problems.Martin J. Green & David A. Cohen - 2008 - Artificial Intelligence 172 (8-9):1094-1118.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • A statistical approach to adaptive problem solving.Jonathan Gratch & Gerald DeJong - 1996 - Artificial Intelligence 88 (1-2):101-142.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • A comparison of structural CSP decomposition methods.Georg Gottlob, Nicola Leone & Francesco Scarcello - 2000 - Artificial Intelligence 124 (2):243-282.
  • Qualitative probabilities for default reasoning, belief revision, and causal modeling.Moisés Goldszmidt & Judea Pearl - 1996 - Artificial Intelligence 84 (1-2):57-112.
    This paper presents a formalism that combines useful properties of both logic and probabilities. Like logic, the formalism admits qualitative sentences and provides symbolic machinery for deriving deductively closed beliefs and, like probability, it permits us to express if-then rules with different levels of firmness and to retract beliefs in response to changing observations. Rules are interpreted as order-of-magnitude approximations of conditional probabilities which impose constraints over the rankings of worlds. Inferences are supported by a unique priority ordering on rules (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   55 citations  
  • Iterative broadening.Matthew L. Ginsberg & William D. Harvey - 1992 - Artificial Intelligence 55 (2-3):367-383.
  • Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
  • Fuzzy constraint networks for signal pattern recognition.P. Félix, S. Barro & R. Marín - 2003 - Artificial Intelligence 148 (1-2):103-140.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Constraint propagation techniques for the disjunctive scheduling problem.Ulrich Dorndorf, Erwin Pesch & Toàn Phan-Huy - 2000 - Artificial Intelligence 122 (1-2):189-240.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Topological parameters for time-space tradeoff.Rina Dechter & Yousri El Fattah - 2001 - Artificial Intelligence 125 (1-2):93-118.
  • Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
  • Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
  • Structure identification in relational data.Rina Dechter & Judea Pearl - 1992 - Artificial Intelligence 58 (1-3):237-270.
  • Structure-driven algorithms for truth maintenance.Rina Dechter & Avi Dechter - 1996 - Artificial Intelligence 82 (1-2):1-20.
  • Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition.Rina Dechter - 1990 - Artificial Intelligence 41 (3):273-312.
  • From local to global consistency.Rina Dechter - 1992 - Artificial Intelligence 55 (1):87-107.
  • Experimental evaluation of preprocessing algorithms for constraint satisfaction problems.Rina Dechter & Itay Meiri - 1994 - Artificial Intelligence 68 (2):211-241.
  • Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.
  • AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.
  • Hybrid tractability of valued constraint problems.Martin C. Cooper & Stanislav Živný - 2011 - Artificial Intelligence 175 (9-10):1555-1569.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.Martin C. Cooper, Peter G. Jeavons & András Z. Salamon - 2010 - Artificial Intelligence 174 (9-10):570-584.
  • Characterising tractable constraints.Martin C. Cooper, David A. Cohen & Peter G. Jeavons - 1994 - Artificial Intelligence 65 (2):347-361.