Recent Advances in Constraints

DOI10.1007/11754602MaRDI QIDQ5899111zbMATH OpenOpenAlexFDO

Authors Igor Razgon

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Constraint satisfaction -- algorithms and complexity analysis
• An initial study of time complexity in infinite-domain constraint satisfaction
• scientific article; zbMATH DE number 1975613
• Recent Advances in Constraints
• Recent Advances in Constraints

Cited in

(8)

• Non-uniform time sharing in the concurrent execution of constraint solving
• A CSP search algorithm with responsibility sets and kernels
• Dynamic Management of Heuristics for Solving Structured CSPs
• Factor Analytic Studies of CSP Heuristics
• scientific article; zbMATH DE number 2080312 (Why is no real title available?)
• Testing the Complexity of a Valued CSP Language
• Recent Advances in Constraints
• Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard

This page was built for publication: Recent Advances in Constraints

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