Combining restarts, nogoods and decompositions for solving CSPs

zbMATH Open1366.68268MaRDI QIDQ5283010FDOQ5283010

Authors: Philippe Jégou, Cyril Terrioux 

Publication date: 18 July 2017

Full work available at URL: http://ebooks.iospress.nl/volumearticle/36984

Recommendations

• Combining restarts, nogoods and bag-connected decompositions for solving csps
• Recording and minimizing nogoods from restarts
• Tree decomposition method combined with separator in constraint satisfaction problems
• Recent Advances in Constraints
• Hybrid backtracking bounded by tree-decomposition of constraint networks

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (5)

• Bounding connected tree-width
• Exploiting Database Management Systems and Treewidth for Counting
• Recording and minimizing nogoods from restarts
• Tree decomposition method combined with separator in constraint satisfaction problems
• Combining restarts, nogoods and bag-connected decompositions for solving csps

This page was built for publication: Combining restarts, nogoods and decompositions for solving CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283010)