Relaxations of semiring constraint satisfaction problems

DOI10.1016/J.IPL.2007.03.011MaRDI QIDQ2379967zbMATH OpenOpenAlexFDO

Authors Louise Leenen, Aditya Ghose, Thomas Meyer

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.03.011

zbMATH Keywords

combinatorial problemsover-constrained problemspreferences and soft constraintssemiring constraint satisfaction problems

Mathematics Subject Classification ID

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

Recommendations

• Semiring-based constraint satisfaction and optimization
• scientific article; zbMATH DE number 1954162
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Semirings for constraint solving and programming.
• Learning solution preferences in constraint problems

Cites work

• scientific article; zbMATH DE number 1954162 (Why is no real title available?)
• Hierarchical constraint logic programming
• Recent Advances in Constraints
• Semiring-based constraint satisfaction and optimization

Cited in

(5)

• Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
• AI 2003: Advances in Artificial Intelligence
• Learning solution preferences in constraint problems
• scientific article; zbMATH DE number 1954162 (Why is no real title available?)
• Exploiting semidefinite relaxations in constraint programming

This page was built for publication: Relaxations of semiring constraint satisfaction problems

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