Arc and path consistence revisited
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Comments on Mohr and Henderson's path consistency algorithm
Artificial Intelligence
An optimal k-consistency algorithm
Artificial Intelligence
Visual occlusion and the interpretation of ambiguous pictures
Visual occlusion and the interpretation of ambiguous pictures
From local to global consistency
Artificial Intelligence
Possibilistic constraint satisfaction problems or “how to handle soft constraints?”
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Data structures and algorithm analysis in C
Data structures and algorithm analysis in C
Characterising tractable constraints
Artificial Intelligence
Fundamental properties of neighbourhood substitution in constraint satisfaction problems
Artificial Intelligence
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
A Substitution Operation for Constraints
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison
Over-Constrained Systems
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Eliminating interchangeable values in constraint satisfaction problems
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
The Interpretation of Line Drawings with Contrast Failure and Shadows
International Journal of Computer Vision
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Arc consistency for soft constraints
Artificial Intelligence
Cyclic consistency: a local reduction operation for binary valued constraints
Artificial Intelligence
Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
Journal of Heuristics
Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes
International Journal of Computer Vision
A multi-agent-based model for a negotiation support system in electronic commerce
Enterprise Information Systems
Semiring-Based Soft Constraints
Concurrency, Graphs and Models
Enhancing constraints manipulation in semiring-based formalisms
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
In the quest of the best form of local consistency for weighted CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Resolution in Max-SAT and its relation to local consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Soft arc consistency revisited
Artificial Intelligence
A weighted CSP approach to cost-optimal planning
AI Communications
Preferences in AI: An overview
Artificial Intelligence
Soft arc consistency applied to optimal planning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Propagating soft table constraints
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
WCSP integration of soft neighborhood substitutability
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Interchangeability with thresholds and degradation factors for Soft CSPs
Annals of Mathematics and Artificial Intelligence
Modularity-based decompositions for valued CSP
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
In the constraint satisfaction problem (CSP) knowledge about a relation on n variables is given in the form of constraints on subsets of the variables. A solution to the CSP is simply an instantiation of the n variables which satisfies all the constraints. The fuzzy constraint satisfaction problem (FCSP) is a generalisation of the CSP to the case in which the constraints are not categorical but represent preferences in the form of fuzzy sets. The FCSP is then an optimisation problem in the space of all possible instantiations of the n variables. It has potentially many more applications in real-world problems than the CSP.When the aim is to maximise the value of the most violated constraint, then the FCSP can be solved by solving a logarithmic number of CSPs. Fuzzy k-consistency can even be established by an algorithm whose worst-case complexity is identical to that of an optimal k-consistency algorithm for CSPs.When the operator used to aggregate constraint values is strictly monotonic (as is the case in MAX-CSP, for example) the classic operation of arc consistency has to be completely redefined. We show that an ordered version of arc consistency exists for all FCSPs with a strictly monotonic aggregation operator, and that, in the case of MAX-CSP, it can be established by an algorithm whose worst-case complexity is identical to that of the optimal arc consistency algorithm for CSPs.Neighbourhood substitution in CSPs can be generalised to fuzzy neighbourhood substitution in FCSPs, whether the aggregation operator is strictly monotonic or idempotent. We give an algorithm for applying fuzzy neighbourhood substitutions until convergence based on the corresponding algorithm for CSPs.