Skip to main content

Verifying Preferential Equivalence and Subsumption via Model Checking

  • Conference paper
Algorithmic Decision Theory (ADT 2013)

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

Included in the following conference series:

  • 1246 Accesses

Abstract

We present a practical, model checking based, approach to verifying whether a set of ceteris paribus preference statements is equivalent to or is subsumed by another. We translate a given pair of sets of preference statements into a labeled transition system (LTS) and reduce the problem of determining whether one set of preference statements is equivalent to or is subsumed by the other to verifying the appropriate computation-tree temporal logic (CTL) formulas in the resulting LTS. Whenever the two sets of preference statements are not equivalent, our method outputs a dominance relationship that is induced by one and not by the other. Our approach is applicable to all preference languages based on ceteris paribus semantics including CP-nets, TCP-nets, CI-nets and CP-Theories.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Hatfield, J.W., Immorlica, N., Kominers, S.D.: Testing substitutability. Games and Economic Behavior 75(2), 639–645 (2012)

    Article  MathSciNet  Google Scholar 

  2. Gusfield, D., Irving, R.W.: The Stable marriage problem - structure and algorithms. Foundations of computing series. MIT Press (1989)

    Google Scholar 

  3. Trabelsi, W., Wilson, N., Bridge, D.G., Ricci, F.: Preference dominance reasoning for conversational recommender systems: a comparison between a comparative preferences and a sum of weights approach. Int’l Journal on Art. Int. Tools 20(4), 591–616 (2011)

    Article  Google Scholar 

  4. Rossi, F., Venable, K.B., Walsh, T.: mcp nets: Representing and reasoning with preferences of multiple agents. In: Proc. of Nat’l Conf. on Art. Int., pp. 729–734. AAAI Press (2004)

    Google Scholar 

  5. Brafman, R.I., Domshlak, C., Shimony, S.E.: On graphical modeling of preference and importance. J. Art. Intel. Res. 25, 389–424 (2006)

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  7. Bouveret, S., Endriss, U., Lang, J.: Conditional importance networks: A graphical language for representing ordinal, monotonic preferences over sets of goods. In: IJCAI, pp. 67–72 (2009)

    Google Scholar 

  8. Brafman, R.I., Pilotto, E., Rossi, F., Salvagnin, D., Venable, K.B., Walsh, T.: The next best solution. In: AAAI (2011)

    Google Scholar 

  9. Martínez, R., Massó, J., Neme, A., Oviedo, J.: On the invariance of the set of stable matchings with respect to substitutable preference profiles. Int. J. Game Theory 36(3-4), 497–518 (2008)

    Article  MathSciNet  Google Scholar 

  10. Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D.: Reasoning with conditional ceteris paribus preference statements. In: UAI, pp. 71–80 (1999)

    Google Scholar 

  11. Santhanam, G.R., Basu, S., Honavar, V.: Dominance testing via model checking. In: AAAI. AAAI Press (2010)

    Google Scholar 

  12. Goldsmith, J., Lang, J., Truszczynski, M., Wilson, N.: The computational complexity of dominance and consistency in cp-nets. J. Art. Intel. Res. 33, 403–432 (2008)

    MathSciNet  MATH  Google Scholar 

  13. Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) International Symposium on Programming. LNCS, vol. 137, pp. 337–351. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  14. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS 8(2), 244–263 (1986)

    Article  Google Scholar 

  15. Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359–364. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Oster, Z.J., Santhanam, G.R., Basu, S., Honavar, V.: Model checking of qualitative sensitivity preferences to minimize credential disclosure. In: Păsăreanu, C.S., Salaün, G. (eds.) FACS 2012. LNCS, vol. 7684, pp. 205–223. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  17. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Cp-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Art. Intel. Res. 21, 135–191 (2004)

    MathSciNet  MATH  Google Scholar 

  18. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press (January 2000)

    Google Scholar 

  19. Santhanam, G.R., Basu, S., Honavar, V.: Efficient dominance testing for unconditional preferences. In: KR (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Santhanam, G.R., Basu, S., Honavar, V. (2013). Verifying Preferential Equivalence and Subsumption via Model Checking. In: Perny, P., Pirlot, M., Tsoukiàs, A. (eds) Algorithmic Decision Theory. ADT 2013. Lecture Notes in Computer Science(), vol 8176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41575-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41575-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41574-6

  • Online ISBN: 978-3-642-41575-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics