Enabling local computation for partially ordered preferences

DOI10.1007/s10601-010-9094-zzbMath1208.68218OpenAlexW1966392869MaRDI QIDQ606907

Nic Wilson, Emma Rollon, Hélène Fargier

Publication date: 19 November 2010

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-010-9094-z

zbMATH Keywords

dynamic programminglocal computationsoft constraintsShafer-Shenoy frameworkvaluation networks/algebra

Mathematics Subject Classification ID

Dynamic programming (90C39) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items

Updating credal networks is approximable in polynomial time, Residuation for bipolar preferences in soft constraints, An axiomatic framework for influence diagram computation with partially ordered preferences

Uses Software

• CP-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shortest path problem with two objective functions
• Semiring induced valuation algebras: exact and approximate local computation algorithms
• A logic of soft constraints based on partially ordered preferences
• Bucket elimination for multiobjective optimization problems
• Local Computation Schemes with Partially Ordered Preferences
• Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making
• Semiring-based constraint satisfaction and optimization
• Plausibility measures and default reasoning