The data complexity of MDatalog in basic modal logics

Authors:
Linh Anh Nguyen
Affiliations:
Institute of Informatics, University of Warsaw, Warsaw, Poland
Venue:
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Year:
2006

Citing 7
Cited 2

A note on the complexity of the satisfiability of modal Horn clauses

Journal of Logic Programming
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

Theoretical Computer Science
First-order modal logic

First-order modal logic
Constructing the least models for positive modal logic programs

Fundamenta Informaticae
linear time datalob and branching time logic

Logic-based artificial intelligence
The Modal Query Language MDatalog

Fundamenta Informaticae
On modal deductive databases

ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems

Foundations of Modal Deductive Databases

Fundamenta Informaticae
Foundations of Modal Deductive Databases

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the data complexity of the modal query language MDatalog and its extension eMDatalog in basic modal logics. MDatalog is a modal extension of Datalog, while eMDatalog is the general modal Horn fragment with the allowedness condition. As the main results, we prove that the data complexity of MDatalog and eMDatalog in K4, KD4, and S4 is PSPACE-complete, in K is coNP-complete, and in KD, T, KB, KDB, and B is PTIME-complete.