The Data Complexity of MDatalog in Basic Modal Logics

DOI10.1007/11821069_63MaRDI QIDQ5756715zbMATH OpenOpenAlexFDO

Authors Linh Anh Nguyen

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_63

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Database theory (68P15)

Recommendations

• The modal query language MDatalog
• Inf-datalog, Modal Logic and Complexities
• Foundations of modal deductive databases
• Circumscribing DATALOG: expressive power and complexity
• Complexity of model checking for modal dependence logic

Cited in

(2)

• Foundations of modal deductive databases
• The modal query language MDatalog

This page was built for publication: The Data Complexity of MDatalog in Basic Modal Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756715)