Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Fundamenta Informaticae - Special issue: logics for artificial intelligence
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Valuation-based systems for discrete optimisation
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Epistemic entrenchment with incomparabilities and relational belief revision
Proceedings of the Workshop on The Logic of Theory Change
Axioms for probability and belief-function proagation
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Information Algebras: Generic Structures for Inference
Information Algebras: Generic Structures for Inference
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A logic of soft constraints based on partially ordered preferences
Journal of Heuristics
Bucket elimination for multiobjective optimization problems
Journal of Heuristics
Semiring induced valuation algebras: Exact and approximate local computation algorithms
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
Planning as satisfiability with preferences
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
Preferred subtheories: an extended logical framework for default reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial 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
Revision of partially ordered information: axiomatization, semantics and iteration
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Multiobjective optimization using GAI models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Plausibility measures and default reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
An order of magnitude calculus
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Updating credal networks is approximable in polynomial time
International Journal of Approximate Reasoning
Solving limited memory influence diagrams
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of valuation functions. Shenoy and Shafer showed how such a computation can be performed using a local computation scheme. A major strength of this work is that it is based on an algebraic description: what is proved is the correctness of the local computation algorithm under a few axioms on the algebraic structure. The instantiations of the framework in practice make use of totally ordered scales. The present paper focuses on the use of partially ordered scales and examines how such scales can be cast in the Shafer---Shenoy framework and thus benefit from local computation algorithms. It also provides several examples of such scales, thus showing that each of the algebraic structures explored here is of interest.