A new approach to partial constraint satisfaction problems

DOI10.1080/00207160412331296724MaRDI QIDQ4652852zbMATH OpenOpenAlexFDO

Authors

Publication date 28 February 2005

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160412331296724

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• A new tractable class of constraint satisfaction problems
• Automata, Languages and Programming
• scientific article; zbMATH DE number 5575002
• Artificial Intelligence: Methodology, Systems, and Applications
• The partial constraint satisfaction problem: Facets and lifting theorems
• scientific article; zbMATH DE number 4162300
• Recent Advances in Constraints
• Parameterized constraint satisfaction problems: a survey
• On approximate constraint satisfaction

Cites work

• Branch-and-Bound Methods: A Survey

Cited in

(14)

• Model agnostic solution of CSPs via deep learning: a preliminary study
• Piecewise linear valued constraint satisfaction problems with fixed number of variables
• A unified framework for partial and hybrid search methods in constraint programming
• scientific article; zbMATH DE number 1696546 (Why is no real title available?)
• scientific article; zbMATH DE number 4162300 (Why is no real title available?)
• scientific article; zbMATH DE number 5575002 (Why is no real title available?)
• scientific article; zbMATH DE number 2079891 (Why is no real title available?)
• scientific article; zbMATH DE number 2084767 (Why is no real title available?)
• Application of exact and heuristic methods to magic square problem
• scientific article; zbMATH DE number 2086994 (Why is no real title available?)
• Automata, Languages and Programming
• Recent Advances in Constraints
• Generalized partial computation using disunification to solve constraints
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: A new approach to partial constraint satisfaction problems

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