An incremental and non-binary CSP solver: The hyperpolyhedron search algorithm

DOI10.1007/3-540-45578-7_79MaRDI QIDQ4735928zbMATH OpenFDO

Authors Miguel A. Salido, Federico Barber

Publication date 9 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390779.htm

Mathematics Subject Classification ID

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

Recommendations

• Disjunction of non-binary and numeric constraint satisfaction problems
• A polynomial algorithm for continuous non-binary disjunctive CSPs
• A compressed generalized hypertree decomposition-based solving technique for non-binary constraint satisfaction problems
• Solving non-binary CSPs using the hidden variable encoding
• scientific article; zbMATH DE number 2243409

Cited in

(6)

• A non-binary constraint ordering heuristic for constraint satisfaction problems
• A CSP search algorithm with responsibility sets and kernels
• scientific article; zbMATH DE number 5996844 (Why is no real title available?)
• Disjunction of non-binary and numeric constraint satisfaction problems
• A compressed generalized hypertree decomposition-based solving technique for non-binary constraint satisfaction problems
• A polynomial algorithm for continuous non-binary disjunctive CSPs

This page was built for publication: An incremental and non-binary CSP solver: The hyperpolyhedron search algorithm

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