Skip to main content

Encoding Preference Queries to an Uncertain Database in Possibilistic Answer Set Programming

  • Conference paper
Advances on Computational Intelligence (IPMU 2012)

Abstract

The representation of preference queries to an uncertain data-base requires a framework capable of dealing with preferences and uncertainty in a separate way. Possibilistic logic has shown to be a suitable setting to support different kinds of preference queries. In this paper, we propose a counterpart of the possibilistic logic-based preference query encoding within a possibilistic logic programming framework. Our approach is capable of dealing with the same interplay of preferences and uncertainty as in possibilistic logic.

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. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)

    Google Scholar 

  2. Benferhat, S., Prade, H.: Compiling possibilistic knowledge bases. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Proc. of the 17th European Conf. on Artificial Intelligence (ECAI 2006), pp. 337–341. IOS Press, Amsterdam (2006)

    Google Scholar 

  3. Bosc, P., Pivert, O., Prade, H.: A Model Based on Possibilistic Certainty Levels for Incomplete Databases. In: Godo, L., Pugliese, A. (eds.) SUM 2009. LNCS, vol. 5785, pp. 80–94. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Bosc, P., Pivert, O., Prade, H.: A Possibilistic Logic View of Preference Queries to an Uncertain Database. In: Proc. of 19th IEEE Int. Conf. on Fuzzy Systems (FUZZ-IEEE 2010), pp. 581–595 (2010)

    Google Scholar 

  5. Brewka, G., Benferhat, S., Le Berre, D.: Qualitative Choice Logic. Artificial Intelligence 157(1-2), 203–237 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brewka, G., Niemelä, I., Syrjänen, T.: Logic Programs with Ordered Disjunction. Computational Intelligence 20(2), 333–357 (2004)

    Article  Google Scholar 

  7. Confalonieri, R., Nieves, J.C., Osorio, M., Vázquez-Salceda, J.: Possibilistic Semantics for Logic Programs with Ordered Disjunction. In: Link, S., Prade, H. (eds.) FoIKS 2010. LNCS, vol. 5956, pp. 133–152. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Confalonieri, R., Nieves, J.C., Vázquez-Salceda, J.: Towards the Implementation of a Preference- and Uncertain-Aware Solver Using Answer Set Programming. Tech. Rep. LSI-10-16-R, Universitat Politècnica de Catalunya, Barcelona, Spain (2010)

    Google Scholar 

  9. Confalonieri, R., Prade, H.: Answer Set Programming for Computing Decisions Under Uncertainty. In: Liu, W. (ed.) ECSQARU 2011. LNCS (LNAI), vol. 6717, pp. 485–496. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Delgrande, J., Schaub, T., Tompits, H., Wang, K.: A classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Computational Intelligence 20(2), 308–334 (2004)

    Article  MathSciNet  Google Scholar 

  11. Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A., Siekmann, J.H. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press, Inc., New York (1994)

    Google Scholar 

  12. Dubois, D., Le Berre, D., Prade, H., Sabbadin, R.: Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms. Fundamenta Informaticae 37(1-2), 1–30 (1999)

    MathSciNet  MATH  Google Scholar 

  13. Govindarajan, K., Jayaraman, B., Mantha, S.: Preference queries in deductive databases. New Generation Computing 19(1), 57–86 (2001)

    Article  MATH  Google Scholar 

  14. Lacroix, M., Lavency, P.: Preferences; Putting More Knowledge into Queries. In: Stocker, P.M., Kent, W., Hammersley, P. (eds.) Proc. of the 13th Int. Conf. on Very Large Data Bases (VLDB 1987), pp. 217–225. Morgan Kaufmann Publishers Inc., San Francisco (1987)

    Google Scholar 

  15. Nicolas, P., Garcia, L., Stéphan, I., Lefèvre, C.: Possibilistic uncertainty handling for answer set programming. Annals of Mathematics and Artificial Intelligence 47(1-2), 139–181 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Nieves, J.C., Osorio, M., Cortés, U.: Semantics for Possibilistic Disjunctive Programs. In: Theory and Practice of Logic Programming (2011), doi: 10.1017/S1471068411000408

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Confalonieri, R., Prade, H. (2012). Encoding Preference Queries to an Uncertain Database in Possibilistic Answer Set Programming. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds) Advances on Computational Intelligence. IPMU 2012. Communications in Computer and Information Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31709-5_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31709-5_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31708-8

  • Online ISBN: 978-3-642-31709-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics