Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Proceedings of the eighth biennial conference of the Canadian Society for Computational Studies of Intelligence on CSCSI-90
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Possibilistic constraint satisfaction problems or “how to handle soft constraints?”
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
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
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Specializing Russian Doll Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Node and arc consistency in weighted CSP
Eighteenth national conference on Artificial intelligence
Constraint Processing
Arc consistency for soft constraints
Artificial Intelligence
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
Enhancements of branch and bound methods for the maximal constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A new local consistency for weighted CSP dedicated to long domains
Proceedings of the 2006 ACM symposium on Applied computing
The complexity of soft constraint satisfaction
Artificial Intelligence
Comparing action descriptions based on semantic preferences
Annals of Mathematics and Artificial Intelligence
A logical approach to efficient Max-SAT solving
Artificial Intelligence
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Artificial Intelligence
Exploiting Decomposition in Constraint Optimization Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Asynchronous Forward-Bounding for Distributed Constraints Optimization
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Soft Constraints Processing over Divisible Residuated Lattices
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
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
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Inference rules for high-order consistency in weighted CSP
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Completeness and performance of the APO algorithm
Journal of Artificial Intelligence Research
Asynchronous forward bounding for distributed COPs
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conflict directed backjumping for Max-CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
Bounds arc consistency for weighted CSPs
Journal of Artificial Intelligence Research
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th 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
The complexity of soft constraint satisfaction
Artificial Intelligence
Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Russian Doll search with tree decomposition
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A cost-based model and algorithms for interleaving solving and elicitation of CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A parameterized local consistency for redundant modeling in weighted CSPs
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Global propagation of practicability constraints
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
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
Local search for distributed asymmetric optimization
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Inference with constrained hidden markov models in prism
Theory and Practice of Logic Programming
BnB-ADOPT+ with Several Soft Arc Consistency Levels
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on 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
Complex university course timetabling
Journal of Scheduling
Filtering algorithms for discrete cumulative problems with overloads of resource
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Expert Systems with Applications: An International Journal
Mini-bucket elimination with bucket propagation
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Clique inference process for solving Max-CSP
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
DR.FILL: crosswords and an implemented solver for singly weighted CSPs
Journal of Artificial Intelligence Research
Max/min-sum distributed constraint optimization through value propagation on an alternating DAG
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Anytime AND/OR depth-first search for combinatorial optimization
AI Communications - The Symposium on Combinatorial Search
An empirical study of encodings for group MaxSAT
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Journal of Artificial Intelligence Research
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
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
Resolution procedures for multiple-valued optimization
Information Sciences: an International Journal
Asymmetric distributed constraint optimization problems
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Recently, a general definition of arc consistency (AC) for soft constraint frameworks has been proposed by T. Schiex [Proc. CP-2000, Singapore, 2000, pp. 411-424]. In this paper we specialize this definition to weighted CSP and introduce two O(ed3) enforcing algorithms. Then, we refine the definition and introduce a stronger form of arc consistency (AC*) along with two O(n2d2+ed3) algorithms. As in the CSP case, an important application of AC is to combine it with search. We empirically demonstrate that a branch and bound algorithm that maintains either AC or AC* is a state-of-the-art general solver for weighted CSP. Our experiments cover binary Max-CSP and Max-SAT problems.