Node and arc consistency in weighted CSP

Authors:
Javier Larrosa
Affiliations:
Department of Software, Universitat Politecnica de Catalunya, Barcelona, Spain
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 10
Cited 34

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Maintaining reversible DAC for Max-CSP

Artificial Intelligence
Radio Link Frequency Assignment

Constraints
An Algorithm for Optimal Winner Determination in Combinatorial Auctions

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Arc Consistency for Soft Constraints

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Refining the basic constraint propagation algorithm

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Russian doll search for solving constraint optimization problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Opportunistic Specialization in Russian Doll Search

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems

Constraints
Arc consistency for soft constraints

Artificial Intelligence
Solving weighted CSP by maintaining arc consistency

Artificial Intelligence
High-Order Consistency in Valued Constraint Satisfaction

Constraints
On global warming: Flow-based soft global constraints

Journal of Heuristics
Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP

Journal of Heuristics
A new local consistency for weighted CSP dedicated to long domains

Proceedings of the 2006 ACM symposium on Applied computing
A logical approach to efficient Max-SAT solving

Artificial Intelligence
Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques

Constraints
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking

Autonomous Agents and Multi-Agent Systems
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
Extending dynamic backtracking to solve weighted conditional CSPs

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Weighted constraint satisfaction with set variables

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
MINIMAXSAT: an efficient weighted max-SAT solver

Journal of Artificial Intelligence Research
Optimal soft arc consistency

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
Bounds arc consistency for weighted CSPs

Journal of Artificial Intelligence Research
Improving tree decomposition methods with function filtering

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
MiniMaxSAT: a new weighted Max-SAT solver

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A parameterized local consistency for redundant modeling in weighted CSPs

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Redundant modeling in permutation weighted constraint satisfaction problems

Constraints
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Developing approaches for solving a telecommunications feature subscription problem

Journal of Artificial Intelligence Research
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
A weighted CSP approach to cost-optimal planning

AI Communications
Connecting BnB-ADOPT with soft arc consistency: initial results

CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Local arc consistency for non-invertible semirings, with an application to multi-objective optimization

Expert Systems with Applications: An International Journal
A decision theoretic meta-reasoner for constraint optimization

AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
Improved algorithm for the soft global cardinality constraint

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Speeding up weighted constraint satisfaction using redundant modeling

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
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
Modularity-based decompositions for valued CSP

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, a general definition of arc consistency (AC) for soft constraint frameworks has been proposed (Schiex 2000). In this paper we specialize this definition to weighted CSP and introduce a O(ed3) algorithm. Then, We refine the definition and introduce a stronger form of arc consistency (AC*) along with a O(n2d3) algorithm. We empirically demonstrate that AC* is likely to be much better than AC in terms of pruned values.