Skip to main content

A Logic for Preference Lifting Under Uncertainty and Its Decidability

  • Conference paper
  • First Online:
Logic and Argumentation (CLAR 2023)

Abstract

This paper explores the idea of the preference lifting under uncertainty. An attempt is proposed in the direction of “qualitative = qualitative + quantitative”. This leads to a novel lifting called the “pairwise lifting method”. It defines a \(\lambda \) function to record the number of occurrences of “\(\ge \) -binary relation” and “\(\le \) -binary relation” between individuals, and the preference relation between sets of individuals can be defined. We consider the logic of preference lifting of arbitrary preference relations, and prove its decidability by two methods, namely reduction to Presburger arithmetic and reduction to linear integer arithmetic.

The research of the first author is supported by Tsinghua University Initiative Scientific Research Program. The research of the second author is supported by the Taishan Young Scholars Program of the Government of Shandong Province, China (No. tsqn201909151).

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The same question can be asked about lifting preference over objects to that of sets of objects. We will not make distinction between worlds and objects in this paper.

References

  1. Boutilier, C.: Conditional logics of normality: a modal approach. Artif. Intell. 68(1), 87–154 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Halpern, J.Y.: Defining relative likelihood in partially-ordered preferential structures. J. Artif. Intell. Res. 7, 1–24 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Holliday, W.H., Icard, T.F.: Measure semantics and qualitative semantics for epistemic modals. Proc. SALT 23, 514–534 (2013)

    Article  Google Scholar 

  4. Jeffrey, R.C.: The Logic of Decision. McGraw-Hill, New York (1965)

    Google Scholar 

  5. Liu, F.: Reasoning about Preference Dynamics. Springer, Dordrecht (2011)

    Book  MATH  Google Scholar 

  6. Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765–768 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  7. Savage, L.: The Foundations of Statistics. Wiley, New York (1954)

    MATH  Google Scholar 

  8. Shi, C., Sun, Y.: Logic of convex order. Stud. Logica. 109(5), 1019–1047 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  9. van Benthem, J., Girard, P., Roy, O.: Everything else being equal: a modal logic for ceteris paribus preferences. J. Philos. Log. 38(1), 83–125 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)

    MATH  Google Scholar 

  11. von Wright, G.H.: The logic of preference. Stud. Logica. 30, 159–162 (1963)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhiguang Zhao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fu, X., Zhao, Z. (2023). A Logic for Preference Lifting Under Uncertainty and Its Decidability. In: Herzig, A., Luo, J., Pardo, P. (eds) Logic and Argumentation. CLAR 2023. Lecture Notes in Computer Science(), vol 14156. Springer, Cham. https://doi.org/10.1007/978-3-031-40875-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-40875-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-40874-8

  • Online ISBN: 978-3-031-40875-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics