2 -Way vs.d -Way Branching for CSP

DOI10.1007/11564751_27MaRDI QIDQ3524188zbMATH OpenOpenAlexFDO

Authors Joey Hwang, David G. Mitchell

Publication date 9 September 2008

Published in Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11564751_27

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• CSP duality and trees of bounded pathwidth
• On the CSP Dichotomy Conjecture
• On the complexity of \#CSP
• A proof of the CSP dichotomy conjecture
• Recent Advances in Constraints
• A branching time model of CSP
• On the reduction of the CSP dichotomy conjecture to digraphs
• Towards sharp inapproximability for any 2-CSP
• scientific article; zbMATH DE number 4172378

Cited in

(6)

• Pool resolution is NP-hard to recognize
• Reasoning from last conflict(s) in constraint programming
• Revisiting restricted path consistency
• Exact Max-SAT solvers for over-constrained problems
• Constraint-Level Advice for Shaving
• Present and Future of Practical SAT Solving

This page was built for publication: 2 -Way vs.d -Way Branching for CSP

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