Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
The logic of constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Local and Global Relational Consistency
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Combining intensional with extensional query evaluation in tuple independent probabilistic databases
Information Sciences: an International Journal
Exploring a Bayesian and linear approach to requirements traceability
Information and Software Technology
Empirical evaluation of approximation algorithms for probabilistic decoding
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Incentive compatible multiagent constraint optimization
WINE'05 Proceedings of the First international conference on Internet and Network Economics
| Hi-index | 0.00 |
This position paper argues that extending the CSP modelto a richer set of tasks such as, constraint optimization, probabilisticinference and decision theoretic tasks can be done within a unifyingframework called ’’bucket elimination‘‘. The framework allowsuniform hybrids for combining elimination and conditioning guidedby the problem‘s structure and for explicating the tradeoffsbetween space and time and between time and accuracy.