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
Reversible DAC and other improvements for solving Max-CSP
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Maintaining reversible DAC for Max-CSP
Artificial Intelligence
Directed Arc Consistency Preprocessing
Constraint Processing, Selected Papers
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
Mini-buckets: a general scheme for generating approximations in automated reasoning
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint 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
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
Cyclic consistency: a local reduction operation for binary valued 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
Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes
International Journal of Computer Vision
What is decreased by the max-sum arc consistency algorithm?
Proceedings of the 24th international conference on Machine learning
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Artificial Intelligence
Semiring-Based Soft Constraints
Concurrency, Graphs and Models
A constraint-guided method with evolutionary algorithms for economic problems
Applied Soft Computing
Directed soft arc consistency in pseudo trees
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
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
Decision with uncertainties, feasibilities, and utilities: towards a unified algebraic framework
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
Local Computation Schemes with Partially Ordered Preferences
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Soft Constraints Processing over Divisible Residuated Lattices
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Local consistency in junction graphs for constraint-based inference
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
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
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
Journal of Artificial Intelligence Research
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
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
Bounded search and symbolic inference for constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on 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
Soft arc consistency revisited
Artificial Intelligence
Bipolar preference problems: framework, properties and solving techniques
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Solving nurse rostering problems using soft global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
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
Semiring-induced propositional logic: definition and basic algorithms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Reducing the search space of resource constrained DCOPs
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
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
Journal of Artificial Intelligence Research
Propagating soft table constraints
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
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
Semiring-based mini-bucket partitioning schemes
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Semiring labelled decision diagrams, revisited: canonicity and spatial efficiency issues
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
The notion of arc consistency plays a central role in constraint satisfaction [R. Dechter, Constraint Processing, Morgan Kaufmann, San Mateo, CA, 2003]. It is known since the introduction of valued and semi-ring constraint networks in 1995 that the notion of local consistency can be extended to constraint optimisation problems defined by soft constraint frameworks based on an idempotent cost combination operator. This excludes non-idempotent operators such as + which define problems which are very important in practical applications such as MAX-CSP, where the aim is to minimise the number of violated constraints.In this paper, we show that using a weak additional axiom satisfied by most existing soft constraints proposals, it is possible to define a notion of soft arc consistency that extends the classical notion of arc consistency and this even in the case of non-idempotent cost combination operators. A polynomial time algorithm for enforcing this soft arc consistency exists and its space and time complexities are identical to that of enforcing arc consistency in CSPs when the cost combination operator is strictly monotonic (for example MAX-CSP).A directional version of arc consistency, first introduced by M.C. Cooper [Reduction operations in fuzzy or valued constraint satisfaction, Fuzzy Sets and Systems 134 (3) (2003) 311-342] is potentially even stronger than the non-directional version, since it allows non-local propagation of penalties. We demonstrate the utility of directional arc consistency by showing that it not only solves soft constraint problems on trees, but that it also implies a form of local optimality, which we call arc irreducibility.