On the decidability of the information flow in Datalog using Magic Sets

Antoun Yaacoub , Hassan Safwan

Logic programming, Information flow, Datalog, Decision problem, Computational complexity, Deductive database

Information flow in logic programming was recently defined using the bottom-up evaluation approach. In this paper, we tackle the same question using the Magic Sets bottom-up evaluation approach. We will show, using this technique that the existence of the information flow is decidable. Finally, we will study the computational complexity of the decidability of the existence of the flow and prove that it is EXPTIME-complete.

Published Paper   E-Certificate

"On the decidability of the information flow in Datalog using Magic Sets", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.2, Issue 1, page no.19 - 27, January-2017, Available :https://ijsdr.org/papers/IJSDR1701005.pdf

Volume 2 Issue 1, January-2017

Pages : 19 - 27

Paper Reg. ID: IJSDR_170013

Published Paper Id: IJSDR1701005

Downloads: 000347034

Research Area: Applied Mathematics

Country: Hadath, Beirut, Lebanon

Published Paper PDF: https://ijsdr.org/papers/IJSDR1701005

Published Paper URL: https://ijsdr.org/viewpaperforall?paper=IJSDR1701005

ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Publisher: IJSDR(IJ Publication) Janvi Wave

This work is licensed under a Creative Commons Attribution 4.0 International License and The Open Definition