Switch to: Citations

References in:

Reasoning from last conflict(s) in constraint programming

Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary & Vincent Vidal

Artificial Intelligence 173 (18):1592-1614 (2009)

Add references

You must login to add references.

Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.details Download Export citation Bookmark 40 citations
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.details Download Export citation Bookmark 11 citations
Branching and pruning: An optimal temporal POCL planner based on constraint programming.Vincent Vidal & Héctor Geffner - 2006 - Artificial Intelligence 170 (3):298-335.details Download Export citation Bookmark 7 citations
Locating the phase transition in binary constraint satisfaction problems.Barbara M. Smith & Martin E. Dyer - 1996 - Artificial Intelligence 81 (1-2):155-181.details Download Export citation Bookmark 10 citations
Strips: A new approach to the application of theorem proving to problem solving.Richard E. Fikes & Nils J. Nilsson - 1971 - Artificial Intelligence 2 (3-4):189-208.details Download Export citation Bookmark 217 citations
An optimal coarse-grained arc consistency algorithm.Christian Bessière, Jean-Charles Régin, Roland H. C. Yap & Yuanlin Zhang - 2005 - Artificial Intelligence 165 (2):165-185.details Download Export citation Bookmark 8 citations

1