Skip to main content

Expressing Preferences from Generic Rules and Examples – A Possibilistic Approach Without Aggregation Function

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3571))

Abstract

This paper proposes an approach to representing preferences about multifactorial ratings. Instead of defining a scale of values and aggregation operations, we propose to express rationality conditions and other generic properties, as well as preferences between specific instances, by means of constraints restricting a complete pre-ordering among tuples of values. The derivation of a single complete pre-order is based on possibility theory, using the minimal specificity principle. Some hints for revising a given preference ordering when new constraints are required, are given. This approach looks powerful enough to capture many aggregation modes, even some violating co-monotonic independence.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benferhat, S., Dubois, D., Prade, H.: Representing default rules in possibilistic logic. In: Proceedings of 3rd International Conference KR 1992, pp. 673–684 (1992)

    Google Scholar 

  2. Benferhat, S., Dubois, D., Prade, H.: Possibilistic and standard probabilistic semantics of conditional knowledge bases. Logic and Computation 9(6), 873–895 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Benferhat, S., Dubois, D., Prade, H.: Towards a possibilistic logic handling of preferences. Applied Intelligence 14(3), 303–317 (2001)

    Article  MATH  Google Scholar 

  4. Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research 21, 135–191 (2004)

    MATH  MathSciNet  Google Scholar 

  5. Chomicki, J.: Preference formulas in relational queries. ACM Transactions on Databases Systems, 1–40 (2003)

    Google Scholar 

  6. Coste-Marquis, S., Lang, J., Liberatore, P., Marquis, P.: Expressive power and succinctness of propositional languages for preference representation. In: Proceedings of KR 2004, pp. 203–212 (2004)

    Google Scholar 

  7. Dubois, D., Marichal, J.-L., Prade, H., Roubens, M., Sabbadin, R.: The use of the discrete sugeno integral in decision-making: a survey. International Journal of Uncertainty, Fuzziness and Knowledge-based Systems 9, 539–561 (2001)

    MATH  MathSciNet  Google Scholar 

  8. Dubois, D., Prade, H.: On different ways of ordering conjoint evaluations. In: Proceedings of the 25th Linz seminar on Fuzzy Set Theory, pp. 42–46 (2004)

    Google Scholar 

  9. Modave, F., Dubois, D., Grabisch, M., Prade, H.: L’Intégrale de Choquet: un Outil de Représentation en Décision Multicritères. In: Rencontres francophones sur la logique floue et ses applications (LFA 1997), pp. 81–90 (1997)

    Google Scholar 

  10. Moulin, H.: Axioms of Cooperative Decision Making. Wiley, New York (1988)

    MATH  Google Scholar 

  11. Moura-Pires, J., Prade, H.: Specifying fuzzy constraints intercations without using aggregation operators. In: Proceedings of FUZZ-IEEE 2000, pp. 228–233 (2000)

    Google Scholar 

  12. Benamor, N., Benferhat, S., Dubois, D., Mellouli, K., Prade, H.: A theorical framework for possibilistic independence in weakly ordered setting. International Journal of Uncertainty Fuzziness and Knowledge-based Systems 10 (2002)

    Google Scholar 

  13. Pearl, J.: A natural ordering of defaults with tractable applications to default reasoning. In: Proceedings TARK 1990, pp. 121–135 (1995)

    Google Scholar 

  14. Slowinski, R., Greco, S., Fortemps, P.: Multicriteria Decision Support Using Rules Representing Rough-graded Preference Relations. In: Proceedings of EUROFUSE 2004, pp. 494–504 (2004)

    Google Scholar 

  15. Wilson, N.: Extending cp-nets with stronger conditional preference statements. In: Proceedings of AAAI 2004, pp. 735–741 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubois, D., Kaci, S., Prade, H. (2005). Expressing Preferences from Generic Rules and Examples – A Possibilistic Approach Without Aggregation Function. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_26

Download citation

  • DOI: https://doi.org/10.1007/11518655_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27326-4

  • Online ISBN: 978-3-540-31888-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics