Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree search and ARC consistency in constraint satisfaction algorithms
Search 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
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Arc Consistency for Soft Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
An Empirical Study of Probabilistic Arc Consistency
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Constraint Propagation for Soft Constraints: Generalization and Termination Conditions
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Directed Arc Consistency Preprocessing
Constraint Processing, Selected Papers
A computational model for causal and diagnostic reasoning in inference systems
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Loopy belief propagation for approximate inference: an empirical study
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Future Play '08 Proceedings of the 2008 Conference on Future Play: Research, Play, Share
A comparison of consistency propagation algorithms in constraint optimization
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
| Hi-index | 0.00 |
We present an abstract generalization of arc consistency which subsumes the definition of arc consistency in classical CSPs. Our generalization is based on the view of local consistency as technique for approximation of marginal solutions. These approximations are intended for use as heuristics during search.We show that this generalization leads to useful application in classical CSPs as well as non-classical CSPs such as MaxCSP, and instances of the Semi-ring CSP formalism developed by Bistarelli et al. [2]. We demonstrate the application ofthe theory by developing a novel algorithm for use in solving MaxCSP.