Skip to main content
SpringerLink
Log in

Possibilistic Conditional Tables

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2016)

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

Included in the following conference series:

Abstract

On the one hand possibility theory and possibilistic logic offer a powerful representation setting in artificial intelligence for handling uncertainty in a qualitative manner. On the other hand conditional tables (c-tables for short) and their probabilistic extension provide a well-known setting for representing respectively incomplete and uncertain information in relational databases. Although these two settings rely on the idea of possible worlds, they have been developed and used independently. This paper investigates the links between possibility theory, possibilistic logic and c-tables, before introducing possibilistic c-tables and discussing their relation with a recent certainty-based approach to uncertain databases and their differences with probabilistic c-tables.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Abiteboul, S., Kanellakis, P.C., Grahne, G.: On the representation and querying of sets of possible worlds. Theor. Comput. Sci. 78(1), 158–187 (1991)

    MathSciNet  MATH  Google Scholar 

  3. Antova, L., Jansen, T., Koch, C., Olteanu, D.: Fast and simple processing of uncertain data. In: Proceedings of the 24th International Conference on Data Engineering (ICDE 2008), pp. 983–992 (2008)

    Google Scholar 

  4. Benjelloun, O., Das Sarma, A., Halevy, A., Theobald, M., Widom, J.: Databases with uncertainty and lineage. VLDB J. 17(2), 243–264 (2008)

    Article  Google Scholar 

  5. Benjelloun, O., Das Sarma, A., Halevy, A., Widom, J.: ULDBs: databases with uncertainty and lineage. In: Proceedings of VLDB 2006, pp. 953–964 (2006)

    Google Scholar 

  6. Bosc, P., Pivert, O.: About projection-selection-join queries addressed to possibilistic relational databases. IEEE T. Fuzzy Syst. 13(1), 124–139 (2005)

    Article  Google Scholar 

  7. Codd, E.F.: Extending the relational database model to capture more meaning. ACM Trans. Database Syst. 4(4), 397–434 (1979)

    Article  Google Scholar 

  8. Dalvi, N., Suciu, D.: Management of probabilistic data: foundations and challenges. In: Proceedings of PODS 2007, pp. 1–12 (2007)

    Google Scholar 

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

    Google Scholar 

  10. Dubois, D., Prade, H.: Possibility Theory: An Approach to Computerized Processing of Uncertainty. Plenum Press, New York (1988). (with the collaboration of H. Farreny, R. Martin-Clouaire, and C. Testemale)

    Book  MATH  Google Scholar 

  11. Dubois, D., Prade, H.: Possibility theory: qualitative and quantitative aspects. In: Gabbay, D.M., Smets, P. (eds.) Quantified Representation of Uncertainty and Imprecision. Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 1, pp. 169–226. Kluwer Academic Publishers, Dordrecht (1998)

    Chapter  Google Scholar 

  12. Dubois, D., Prade, H.: Possibilistic logic – an overview. In: Siekmann, J.H. (ed.) Computational Logic. Handbook of the History of Logic, vol. 9, pp. 283–342. Elsevier, Amsterdam (2014)

    Google Scholar 

  13. Dubois, D., Prade, H., Schockaert, S.: Stable models in generalized possibilistic logic. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), pp. 519–529. AAAI Press, Menlo Park (2012)

    Google Scholar 

  14. Gallaire, H., Minker, J.J. (eds.): Advances in Data Base Theory. In: Proceedings of the Symposium on Logic and Data Bases, Centre d’ Etudes et de Recherches de Toulouse, 1977. Plenum Press (1978)

    Google Scholar 

  15. Grahne, G.: The Problem of Incomplete Information in Relational Databases. LNCS, vol. 554. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  16. Green, C.: Theorem-proving by resolution as a basis for question-answering systems. In: Michie, D., Meltzer, B. (eds.) Machine Intelligence, vol. 4, pp. 183–205. Edinburgh University Press, Edinburgh (1969)

    Google Scholar 

  17. Green, T.J., Tannen, V.: Models for incomplete and probabilistic information. In: Proceedings of the IIDB 2006 Workshop, pp. 278–296 (2006)

    Google Scholar 

  18. Imielinski, T., Lipski, W.: Incomplete information in relational databases. J. ACM 31(4), 761–791 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lang, J.: Possibilistic logic: complexity and algorithms. In: Kohlas, J., Moral, S. (eds.) Algorithms for Uncertainty and Defeasible Reasoning. Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 5, pp. 179–220. Kluwer Academic Publisher, Dordrecht (2001). (Gabbay, D.M. and Smets, Ph., eds.)

    Google Scholar 

  20. Lipski, W.: On semantic issues connected with incomplete information databases. ACM Trans. Database Syst. 4(3), 262–296 (1979)

    Article  Google Scholar 

  21. Lipski, W.: On databases with incomplete information. J. ACM 28, 41–70 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  22. Pivert, O., Prade, H.: A certainty-based model for uncertain databases. IEEE Trans. Fuzzy Syst. 23(4), 1181–1196 (2015)

    Article  Google Scholar 

  23. Prade, H.: The connection between Lipski’s approach to incomplete information data bases and Zadeh’s possibility theory. In: Proceedings of the International Conference on Systems Methodology, Washington, D.C., 5–9 January, pp. 402–408 (1982)

    Google Scholar 

  24. Prade, H.: Lipski’s approach to incomplete information data bases restated and generalized in the setting of Zadeh’s possibility theory. Inf. Syst. 9(1), 27–42 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  25. Prade, H., Testemale, C.: Generalizing database relational algebra for the treatment of incomplete/uncertain information and vague queries. Inf. Sci. 34(2), 115–143 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  26. Shimizu, S., Ishihara, Y., Takarabe, T., Ito, M.: A probabilistic database model with representability of dependency among tuples. In: Proceedings of the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2000), pp. 221–225 (2000)

    Google Scholar 

  27. Suciu, D., Olteanu, D., Ré, C., Koch, C.: Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers (2011)

    Google Scholar 

  28. Zadeh, L.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst. 1(1), 3–28 (1978)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Irisa – Enssat, University of Rennes 1, Technopole Anticipa, 22305, Lannion Cedex, France

    Olivier Pivert

  2. IRIT, CNRS and University of Toulouse, 31062, Toulouse Cedex 9, France

    Henri Prade

  3. QCIS, University of Technology, Sydney, Australia

    Henri Prade

Authors
  1. Olivier Pivert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henri Prade
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Henri Prade .

Editor information

Editors and Affiliations

  1. Faculteit Wetenschappen, Universiteit Hasselt, Hasselt, Belgium

    Marc Gyssens

  2. Dept. Ciencias Ingeniería Computación, Universidad Nacional del Sur, Bahía Blanca, Argentina

    Guillermo Simari

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Pivert, O., Prade, H. (2016). Possibilistic Conditional Tables. In: Gyssens, M., Simari, G. (eds) Foundations of Information and Knowledge Systems. FoIKS 2016. Lecture Notes in Computer Science(), vol 9616. Springer, Cham. https://doi.org/10.1007/978-3-319-30024-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30024-5_3

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation