Foundations of Modal Deductive Databases

We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the top-down evaluation algorithm, and the magic-set transformation for MDatalog queries. The results of this paper like soundness and completeness of the top-down evaluation algorithm or correctness of the magic-set transformation are proved for the multimodal logics of belief KDI4s5, KDI45, KD4s5s, KD45(m), KD4Ig5a, and the class of serial contextfree grammar logics. We also show that MDatalog has PTIME data complexity in the logics KDI4s5, KDI45, KD4s5s, and KD45(m).

• Type: Journal
• Year: 2007
• Where: FUIN
• Authors: Linh Anh Nguyen
• Keywords: Evaluation Algorithm, FUIN 2007, Modal Deductive Databases, Top-down Evaluation Algorithm