Existential arc consistency: getting closer to full arc consistency in weighted CSPs

Authors:
Simon de Givry;Matthias Zytnicki;Federico Heras;Javier Larrosa
Affiliations:
INRA, Toulouse, France;INRA, Toulouse, France;LSI, UPC, Barcelona, Spain;LSI, UPC, Barcelona, Spain
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 5
Cited 51

Arc consistency for soft constraints

Artificial Intelligence
Solving weighted CSP by maintaining arc consistency

Artificial Intelligence
Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
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
Refining the basic constraint propagation algorithm

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

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

Journal of Heuristics
A logical approach to efficient Max-SAT solving

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

Constraints
Extension of the Top-Down Data-Driven Strategy to ILP

Inductive Logic Programming
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques

Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Multi-Objective Propagation in Constraint Programming

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A Decomposition Technique for Max-CSP

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Memory intensive branch-and-bound search for graphical models

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
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
Memory intensive AND/OR 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
Best-first AND/OR search for graphical models

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Relaxed survey propagation: a sum-product algorithm for Max-SAT

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Virtual Arc consistency for weighted CSP

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
MINIMAXSAT: an efficient weighted max-SAT solver

Journal of Artificial Intelligence Research
The logic behind weighted CSP

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Optimal soft arc consistency

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A dynamic approach to MPE and weighted MAX-SAT

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Bounds arc consistency for weighted CSPs

Journal of Artificial Intelligence Research
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
Russian Doll search with tree decomposition

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Evaluating the impact of AND/OR search on 0-1 integer linear programming

Constraints
Relaxed survey propagation for the weighted maximum satisfiability problem

Journal of Artificial Intelligence Research
Soft arc consistency revisited

Artificial Intelligence
MiniMaxSAT: a new weighted Max-SAT solver

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Valid inequality based lower bounds for WCSP

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
Clone: solving weighted Max-SAT in a reduced search space

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
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
Redundant modeling in permutation weighted constraint satisfaction problems

Constraints
Point-based backup for decentralized POMDPs: complexity and new algorithms

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Towards parallel non serial dynamic programming for solving hard weighted CSP

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A weighted CSP approach to cost-optimal planning

AI Communications
Soft arc consistency applied to optimal planning

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
On SAT modulo theories and optimization problems

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Conflict-Directed a* search for soft constraints

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
DR.FILL: crosswords and an implemented solver for singly weighted CSPs

Journal of Artificial Intelligence Research
Distributed constraint optimization problems related with soft arc consistency

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction

Journal of Artificial Intelligence Research
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
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
Resolution procedures for multiple-valued optimization

Information Sciences: an International Journal
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories

Constraints
Dynamic virtual arc consistency

Proceedings of the 28th Annual ACM Symposium on Applied Computing
Modularity-based decompositions for valued CSP

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The weighted CSP framework is a soft constraint framework with a wide range of applications. Most current state-of-the-art complete solvers can be described as a basic depth-first branch and bound search that maintain some form of arc consistency during the search. In this paper we introduce a new stronger form of arc consistency, that we call existential directional arc consistency and we provide an algorithm to enforce it. The efficiency of the algorithm is empirically demonstrated in a variety of domains.