Relaxations of semiring constraint satisfaction problems

DOI10.1016/J.IPL.2007.03.011zbMATH Open1187.68553OpenAlexW2159311851MaRDI QIDQ2379967FDOQ2379967

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

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

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)

Cites Work

• Semiring-based constraint satisfaction and optimization
• Hierarchical constraint logic programming
• Title not available (Why is that?)
• Recent Advances in Constraints

Cited In (5)

• Title not available (Why is that?)
• Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
• AI 2003: Advances in Artificial Intelligence
• Exploiting semidefinite relaxations in constraint programming
• Learning solution preferences in constraint problems

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)