On modal deductive databases

Authors:
Linh Anh Nguyen
Affiliations:
Institute of Informatics, University of Warsaw, Warsaw, Poland
Venue:
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Year:
2005

Citing 8
Cited 5

A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Multimodal logic programming using equational and order-sorted logic

Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
First-order modal logic

First-order modal logic
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Temporal Query Languages: A Survey

ICTL '94 Proceedings of the First International Conference on Temporal Logic
How to Use Modalities and Sorts in Prolog

JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
A fixpoint semantics and an SLD-resolution calculus for modal logic programs

Fundamenta Informaticae
The Modal Query Language MDatalog

Fundamenta Informaticae

Multimodal logic programming

Theoretical Computer Science
Foundations of Modal Deductive Databases

Fundamenta Informaticae
The data complexity of MDatalog in basic modal logics

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Reasoning about epistemic states of agents by modal logic programming

CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Foundations of Modal Deductive Databases

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a query language called MDatalog, which is an extension of Datalog for multimodal deductive databases. We define modal relational algebras and give the seminaive evaluation algorithm and the magic-set transformation for MDatalog queries. Results of this paper are proved for the multimodal logics of belief KDI4s5, KDI45, KD4s5s, KD45(m), which are extensions of the monomodal logic KD45. We show that MDatalog has PTIME data complexity in these logics.