Valued constraint satisfaction problems

DOI10.1007/978-3-030-06167-8_7MaRDI QIDQ6602254zbMATH OpenFDO

Authors M. C. Cooper, Simon de Givry, Thomas Schiex

Publication date 11 September 2024

Full work available at URL https://doi.org/10.1007/978-3-030-06167-8_7

Mathematics Subject Classification ID

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

Recommendations

• A note on some collapse results of valued constraints
• The complexity of valued constraint satisfaction problems
• Hybrid tractability of valued constraint problems
• An Algebraic Approach to Valued Constraint Satisfaction
• Algebraic properties of valued constraint satisfaction problem

Cites work

• A unified framework for partial and hybrid search methods in constraint programming
• An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
• Arc consistency for soft constraints
• Bounded backtracking for the valued constraint satisfaction problems
• Bounds arc consistency for weighted CSPs
• Bucket elimination: A unifying framework for reasoning
• Combining VNS with constraint programming for solving anytime optimization problems
• Compiling propositional weighted bases
• Computational protein design as an optimization problem
• Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction
• DARN! A weighted constraint solver for RNA motif localization
• Decision diagrams for optimization
• Exploiting tree decomposition for guiding neighborhoods exploration for VNS
• Extension of the Top-Down Data-Driven Strategy to ILP
• Factor graphs and the sum-product algorithm
• High-order consistency in valued constraint satisfaction
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 2080314 (Why is no real title available?)
• scientific article; zbMATH DE number 2080322 (Why is no real title available?)
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
• Multi-language evaluation of exact solvers in graphical model discrete optimization
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004
• Pseudo-Boolean optimization
• Radio link frequency assignment
• Reduction operations in fuzzy or valued constraint satisfaction
• Semiring-based constraint satisfaction and optimization
• Soft arc consistency revisited
• Solving the crop allocation problem using hard and soft constraints
• Submodular functions and optimization.
• The complexity of valued constraint satisfaction
• The generalized distributive law
• Tractability-preserving transformations of global cost functions
• Tractable constraints on ordered domains
• Triangle-based consistencies for cost function networks

Cited in

(2)

• Learning additive decompositions of multiattribute utility functions
• Automatic error function learning with interpretable compositional networks

This page was built for publication: Valued constraint satisfaction problems

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