한국정보과학회논문지:소프트웨어및응용 (Journal of KIISE:Software and Applications)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

선형논리에 기반한 불확실성 데이터베이스 의미론

Semantics of Uncertain Databases based on Linear Logic

  • 발행 : 2010.02.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

불확실성 데이터베이스의 의미론 정의는 보통 주어진 불확실성 데이터베이스를 여러 개의 관계형데이터베이스로 변환하는 산술적 접근방법을 취한다. 이 논문에서는 불확실성데이터베이스를 논리이론으로 변환하는 논리적 접근방법을 통해서 불확실성 데이터베이스의 의미론을 정의하고자 한다. 본 논문에서 제안하는 의미론의 가장 특징적인 면은 기존의 논리적 접근방법에서 사용해온 명제논리 대신에 선형논리를 논리적 근간으로 이용한다는 점이다. 선형논리는 논리식을 불변진리가 아닌 소비가능한 자원으로 해석하기 때문에 불확실성 데이터베이스의 의미론을 정의하는데 적합하다. 본 논문의 핵심 결과는 선형논리에 기반한 불확실성 데이터베이스의 의미론이 산술적 접근방식에서 설명하는 불확실성 데이터베이스의 의미론과 동등하다는 것이다.

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.

키워드

참고문헌

  1. T. Imieli'nski and W. Lipski, Jr. Incomplete information in relational databases. Journal of ACM, 31(4):761-791, 1984. https://doi.org/10.1145/1634.1886
  2. 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.
  3. M. Y. Vardi. Querying logical databases. In Proceedings of the Symposium on Principles of Database Systems, pp.57-65. ACM, 1985.
  4. R. Reiter. A sound and sometimes complete query evaluation algorithm for relational databases with null values. Journal of ACM, 33(2):349-370, 1986. https://doi.org/10.1145/5383.5388
  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. 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.
  7. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1-102, 1987. https://doi.org/10.1016/0304-3975(87)90045-4
  8. G. Kahn. Natural semantics. In 4th Annual Symposium on Theoretical Aspects of Computer Sciences (STACS), pp.22-39. Springer-Verlag, 1987.
  9. 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.
  10. 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.
  11. K.-C. Liu and R. Sunderraman. Indefinite and maybe information in relational databases. ACM Transactions on Database Systems, 15(1):1-39, 1990. https://doi.org/10.1145/77643.77644
  12. E. Zim'anyi. Incomplete and Uncertain Information in Relational Databases. PhD thesis, Universit'e Libre de Bruxelles, Brussels, Belgium, October 1992.