Foundations of Modal Deductive Databases

  • Authors:
  • Linh Anh Nguyen

  • Affiliations:
  • Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warszawa, Poland. E-mail: nguyen@mimuw.edu.pl

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We give formulations for modal deductive databases and present amodal query language called MDatalog. We define modal relationalalgebras and give the seminaive evaluation algorithm, the top-downevaluation algorithm, and the magic-set transformation for MDatalogqueries. The results of this paper like soundness and completenessof the top-down evaluation algorithm or correctness of themagic-set transformation are proved for the multimodal logics ofbelief KDI4_s5, KDI45, KD4_s5_s, KD45_{(m)}, KD4I_g5_a, and theclass of serial context-free grammar logics. We also show thatMDatalog has PTIME data complexity in the logics KDI4_s5, KDI45,KD4_s5_s, and KD45_{(m)}.