Sciweavers

32 search results - page 1 / 7
» Relaxations of semiring constraint satisfaction problems
Sort
View
IPL
2007
71views more  IPL 2007»
13 years 6 months ago
Relaxations of semiring constraint satisfaction problems
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
Louise Leenen, Thomas Andreas Meyer, Aditya Ghose
ECAI
2006
Springer
13 years 10 months ago
Enhancing Constraints Manipulation in Semiring-Based Formalisms
Abstract. Many "semiring-like" structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing w...
Stefano Bistarelli, Fabio Gadducci
MICAI
2004
Springer
13 years 11 months ago
Evaluation-Based Semiring Meta-constraints
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
Jerome Kelleher, Barry O'Sullivan
IJCAI
1993
13 years 7 months ago
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
CPAIOR
2006
Springer
13 years 10 months ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...