Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Node and arc consistency in weighted CSP
Eighteenth national conference on Artificial intelligence
Arc consistency for soft constraints
Artificial Intelligence
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
A new local consistency for weighted CSP dedicated to long domains
Proceedings of the 2006 ACM symposium on Applied computing
Stronger Consistencies in WCSPs with Set Variables
ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
A Soft Approach to Multi-objective Optimization
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
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
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Bounds arc consistency for weighted CSPs
Journal of Artificial Intelligence Research
Soft arc consistency revisited
Artificial Intelligence
A parameterized local consistency for redundant modeling in weighted CSPs
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Extending soft arc consistency algorithms to non-invertible semirings
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
Hi-index | 12.05 |
We extend algorithms for local arc consistency proposed in the literature in order to deal with (absorptive) semirings that may not be invertible. As a consequence, these consistency algorithms can be used as a pre-processing procedure in soft Constraint Satisfaction Problems (CSPs) defined over a larger class of semirings, such as those obtained from the Cartesian product of two (or more) semirings. One important instance of this class of semirings is adopted for multi-objective CSPs. First, we show how a semiring can be transformed into a novel one where the + operator is instantiated with the least common divisor (LCD) between the elements of the original semiring. The LCD value corresponds to the amount we can ''safely move'' from the binary constraint to the unary one in the arc consistency algorithm. We then propose a local arc consistency algorithm which takes advantage of this LCD operator.