A new polynomial-time algorithm for linear programming
Combinatorica
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Radio Link Frequency Assignment
Constraints
Discrete Applied Mathematics
Node and arc consistency in weighted CSP
Eighteenth national conference on Artificial intelligence
Reduction operations in fuzzy or valued constraint satisfaction
Fuzzy Sets and Systems - Optimisation and decision
Arc consistency for soft constraints
Artificial Intelligence
Cyclic consistency: a local reduction operation for binary valued constraints
Artificial Intelligence
Computing lower bound for MAX-CSP problems
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
Journal of Heuristics
Exploiting tree decomposition and soft local consistency in weighted CSP
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
New inference rules for efficient Max-SAT solving
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Exploiting Decomposition in Constraint Optimization Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A Decomposition Technique for Max-CSP
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Soft Constraints Processing over Divisible Residuated Lattices
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Bounds arc consistency for weighted CSPs
Journal of Artificial Intelligence Research
Exploiting decomposition on constraint problems with high tree-width
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Soft arc consistency revisited
Artificial Intelligence
Valid inequality based lower bounds for WCSP
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A Max-SAT inference-based pre-processing for Max-clique
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A weighted CSP approach to cost-optimal planning
AI Communications
Benchmarking hybrid algorithms for distributed constraint optimisation games
Autonomous Agents and Multi-Agent Systems
Preferences in AI: An overview
Artificial Intelligence
The Knowledge Engineering Review
Consistencies for ultra-weak solutions in minimax weighted CSPs using the duality principle
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Computational protein design as a cost function network optimization problem
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Modularity-based decompositions for valued CSP
Annals of Mathematics and Artificial Intelligence
Dynamic multiagent load balancing using distributed constraint optimization techniques
Web Intelligence and Agent Systems
| Hi-index | 0.00 |
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by shifting weights between cost functions. The principal aim is to produce a good lower bound on the cost of solutions, an essential ingredient of a branch and bound search. But soft AC is much more complex than traditional AC: there may be several closures (fixpoints) and finding the closure with a maximum lower bound has been shown to be NP-hard for integer costs [Cooper and Schiex, 2004]. We introduce a relaxed variant of soft arc consistency using rational costs. In this case, an optimal closure can be found in polynomial time. Furthermore, for finite rational costs, the associated lower bound is shown to provide an optimal arc consistent reformulation of the initial problem. Preliminary experiments on random and structured problems are reported, showing the strength of the lower bound produced.