Disjunction of non-binary and numeric constraint satisfaction problems

DOI10.1007/3-540-36079-4_14MaRDI QIDQ4438830zbMATH OpenFDO

Authors Miguel A. Salido, Federico Barber

Publication date 10 December 2003

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/2504/25040159.htm

zbMATH Keywords

CSPsdisjunctive constraintsnon-binary constraints

Mathematics Subject Classification ID

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

Recommendations

• A polynomial algorithm for continuous non-binary disjunctive CSPs
• An incremental and non-binary CSP solver: The hyperpolyhedron search algorithm
• scientific article; zbMATH DE number 2243409
• A compressed generalized hypertree decomposition-based solving technique for non-binary constraint satisfaction problems
• A non-binary constraint ordering heuristic for constraint satisfaction problems

Cited in

(6)

• Binary constraint satisfaction problems defined by excluded topological minors
• Disjunctive Programs with Set Constraints
• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
• Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
• An incremental and non-binary CSP solver: The hyperpolyhedron search algorithm
• A polynomial algorithm for continuous non-binary disjunctive CSPs

This page was built for publication: Disjunction of non-binary and numeric constraint satisfaction problems

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