Enabling local computation for partially ordered preferences
DOI10.1007/S10601-010-9094-ZzbMATH Open1208.68218OpenAlexW1966392869MaRDI QIDQ606907FDOQ606907
Authors: Hélène Fargier, Emma Rollon, Nic Wilson 
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
Recommendations
dynamic programminglocal computationsoft constraintsShafer-Shenoy frameworkvaluation networks/algebra
Dynamic programming (90C39) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Title not available (Why is that?)
- Plausibility measures and default reasoning
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making
- The shortest path problem with two objective functions
- Semiring-based constraint satisfaction and optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A logic of soft constraints based on partially ordered preferences
- Bucket elimination for multiobjective optimization problems
- Local Computation Schemes with Partially Ordered Preferences
Cited In (5)
- Local Computation Schemes with Partially Ordered Preferences
- Arranging program statements for locality on the basis of neighbourhood preferences
- Residuation for bipolar preferences in soft constraints
- Updating credal networks is approximable in polynomial time
- An axiomatic framework for influence diagram computation with partially ordered preferences
Uses Software
This page was built for publication: Enabling local computation for partially ordered preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606907)
