Skip to main content

Preference Queries with Ceteris Paribus Semantics for Linked Data

  • Conference paper
  • First Online:
On the Move to Meaningful Internet Systems: OTM 2015 Conferences (OTM 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9415))

Abstract

User preferences play a central role in supporting complex and multifactorial decision processes. Every personalized information filtering system should exploit a preferences model of the user in order to match her interests as much as possible. In a Linked Open Data (LOD) setting, the problem is twofold. On the one hand, there is the need of a standard way to represent complex preferences. On the other hand, we need tools able to query LOD datasets by taking into account user’s preferences. In this paper, we propose a vocabulary to represent statements formulated in terms of ceteris paribus semantics. We then show (i) how to represent a CP-net by means of this vocabulary and (ii) how to embed such compact preference model in a SPARQL 1.1 query in order to access semantic data in a personalized way.

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 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.

References

  1. Berners-Lee, T., Hendler, J., Lassila, O.: The Semantic Web. Sci. Am. 284(5), 34–43 (2001)

    Article  Google Scholar 

  2. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proc. of ICDE, pp. 421–430 (2001)

    Google Scholar 

  3. 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. Artif. Intell. Res. 21, 135–191 (2004)

    MATH  MathSciNet  Google Scholar 

  4. Brafman, R.I., Domshlak, C.: Introducing variable importance tradeoffs into CP-nets. In: Proc. of UAI, pp. 69–76 (2002)

    Google Scholar 

  5. Chomicki, J.: Preference formulas in relational queries. ACM Trans. Database Syst. 28(4), 427–466 (2003)

    Article  Google Scholar 

  6. Chomicki, J.: Logical foundations of preference queries. IEEE Data Eng. Bull. 34(2), 3–10 (2011)

    Google Scholar 

  7. Dimopoulos, Y., Michael, L., Athienitou, F.: Ceteris paribus preference elicitation with predictive guarantees. In: Proc. of IJCAI, pp. 1890–1895 (2009)

    Google Scholar 

  8. Domshlak, C., Hüllermeier, E., Kaci, S., Prade, H.: Preferences in AI: An overview. Artif. Intell. 175(7/8), 1037–1052 (2011)

    Article  Google Scholar 

  9. Doyle, J.: Prospects for preferences. Comput. Intell. 20(2), 111–136 (2004)

    Article  MathSciNet  Google Scholar 

  10. Fishburn, P.C.: Utility theory for decision making. Publications in operations research, J. Wiley (1970)

    Google Scholar 

  11. Fürnkranz, J., Hüllermeier, E.: Preference Learning. Springer (2010)

    Google Scholar 

  12. Guerin, J.T., Allen, T.E., Goldsmith, J.: Learning CP-net preferences online from user queries. In: Perny, P., Pirlot, M., Tsoukiàs, A. (eds.) ADT 2013. LNCS, vol. 8176, pp. 208–220. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  13. Gueroussova, M., Polleres, A., McIlraith, S.A.: SPARQL with qualitative and quantitative preferences. In: Proc. of OrdRing, pp. 2–8 (2013)

    Google Scholar 

  14. Harris, S., Seaborne, A.: SPARQL 1.1 query language (2013). http://www.w3.org/TR/2013/REC-sparql11-query-20130321/

  15. Kießling, W.: Foundations of preferences in database systems. In: Proc. of VLDB, pp. 311–322 (2002)

    Google Scholar 

  16. Kießling, W., Endres, M., Wenzel, F.: The preference SQL system – an overview. IEEE Data Eng. Bull. 34(2), 11–18 (2011)

    Google Scholar 

  17. Li, C., Soliman, M.A., Chang, K.C.C., Ilyas, I.F.: RankSQL: Supporting ranking queries in relational database management systems. In: Proc. of VLDB, pp. 1342–1345 (2005)

    Google Scholar 

  18. Schreiber, G., Raimond, Y.: RDF 1.1 Primer (2014). http://www.w3.org/TR/rdf11-primer/

  19. Siberski, W., Pan, J.Z., Thaden, U.: Querying the semantic web with preferences. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 612–624. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  20. Wilson, N.: Extending CP-nets with stronger conditional preference statements. In: Proc. of AAAI, pp. 735–741 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jessica Rosati .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Rosati, J., Di Noia, T., Lukasiewicz, T., De Leone, R., Maurino, A. (2015). Preference Queries with Ceteris Paribus Semantics for Linked Data. In: Debruyne, C., et al. On the Move to Meaningful Internet Systems: OTM 2015 Conferences. OTM 2015. Lecture Notes in Computer Science(), vol 9415. Springer, Cham. https://doi.org/10.1007/978-3-319-26148-5_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26148-5_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26147-8

  • Online ISBN: 978-3-319-26148-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics