Browse > Article

Semantics of Uncertain Databases based on Linear Logic  

Park, Sung-Woo (POSTECH 컴퓨터공학과)
Publication Information
Journal of KIISE:Software and Applications / v.37, no.2, 2010 , pp. 148-154 More about this Journal
Abstract
In the study of the formal semantics of uncertain databases, we typically take an algebraic approach by mapping an uncertain database to possible worlds which are a set of relational databases. In this paper, we present a new semantics for uncertain databases which takes a logical approach by translating uncertain databases into logical theories. A characteristic feature of our semantics is that it uses linear logic, instead of propositional logic, as its logical foundation. Linear logic is suitable for a logical interpretation of uncertain information because unlike propositional logic, it treats logical formulae not as persistent facts but as consumable resources. As the main result, we show that our semantics is faithful to the operational account of uncertain databases in the algebraic approach.
Keywords
Uncertain database; semantics; linear logic;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Das Sarma, O. Benjelloun, A. Halevy, and J. Widom. Working models for uncertain data. In Proceedings of the International Conference on Data Engineering, pp.7. IEEE, 2006.
2 R. van der Meyden. Logical approaches to incomplete information: a survey. In Logics for databases and information systems, pp.307-356. Kluwer Academic Publishers, 1998.
3 E. Zim'anyi. Incomplete and Uncertain Information in Relational Databases. PhD thesis, Universit'e Libre de Bruxelles, Brussels, Belgium, October 1992.
4 R. Reiter. Towards a logical reconstruction of relational database theory. In M. L. Brodie, J. Mylopoulos, and J. W. Schmidt, editors, On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases, and Programming Languages, pp.191-233. Springer, 1984.
5 O. Benjelloun, A. Das Sarma, A. Halevy, and J. Widom. ULDBs: databases with uncertainty and lineage. In Proceedings of the International Conference on Very Large Data Bases, pp.953-964, 2006.
6 M. Y. Vardi. Querying logical databases. In Proceedings of the Symposium on Principles of Database Systems, pp.57-65. ACM, 1985.
7 G. Kahn. Natural semantics. In 4th Annual Symposium on Theoretical Aspects of Computer Sciences (STACS), pp.22-39. Springer-Verlag, 1987.
8 K.-C. Liu and R. Sunderraman. Indefinite and maybe information in relational databases. ACM Transactions on Database Systems, 15(1):1-39, 1990.   DOI
9 T. Imieli'nski and W. Lipski, Jr. Incomplete information in relational databases. Journal of ACM, 31(4):761-791, 1984.   DOI   ScienceOn
10 B. Chang, K. Chaudhuri, and F. Pfenning. A judgmental analysis of linear logic. Technical Report CMU-CS-03-131, School of Computer Science, Carnegie Mellon University, 2003.
11 R. Reiter. A sound and sometimes complete query evaluation algorithm for relational databases with null values. Journal of ACM, 33(2):349-370, 1986.   DOI   ScienceOn
12 J.-Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1-102, 1987.   DOI   ScienceOn