Enabling local computation for partially ordered preferences

DOI10.1007/S10601-010-9094-ZMaRDI QIDQ606907zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Local Computation Schemes with Partially Ordered Preferences
• An axiomatic framework for influence diagram computation with partially ordered preferences
• Local computation with valuations from a commutative semigroup
• Computation in valuation algebras
• Working with Preferences: Less Is More

Cites work

• scientific article; zbMATH DE number 4174344 (Why is no real title available?)
• scientific article; zbMATH DE number 19878 (Why is no real title available?)
• scientific article; zbMATH DE number 35413 (Why is no real title available?)
• scientific article; zbMATH DE number 1333622 (Why is no real title available?)
• scientific article; zbMATH DE number 1945067 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• A logic of soft constraints based on partially ordered preferences
• Bucket elimination for multiobjective optimization problems
• Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making
• Local Computation Schemes with Partially Ordered Preferences
• Plausibility measures and default reasoning
• Semiring induced valuation algebras: exact and approximate local computation algorithms
• Semiring-based constraint satisfaction and optimization
• The shortest path problem with two objective functions

Cited in

(5)

• Arranging program statements for locality on the basis of neighbourhood preferences
• Local Computation Schemes with Partially Ordered 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

Describes a project that uses

Uses Software

• CP-nets

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)