Local Computation Schemes with Partially Ordered Preferences
From MaRDI portal
Publication:3638136
DOI10.1007/978-3-642-02906-6_5zbMath1245.68212MaRDI QIDQ3638136
Publication date: 2 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_5
68T37: Reasoning under uncertainty in the context of artificial intelligence
Related Items
Enabling local computation for partially ordered preferences, Decision making with multiple objectives using GAI networks
Cites Work
- Arc consistency for soft constraints
- The shortest path problem with two objective functions
- Advances in prospect theory: cumulative representation of uncertainty
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- Bucket elimination for multiobjective optimization problems
- Algebraic Structures for Bipolar Constraint-Based Reasoning
- Plausibility measures and default reasoning
- Unnamed Item
- Unnamed Item
- Unnamed Item