More on tractable disjunctive Datalog

Author： Ben-Eliyahu-Zohary R.   Palopoli L.   Zemlyanker V.  

Publisher： Elsevier

ISSN： 0743-1066

Source： The Journal of Logic Programming, Vol.46, Iss.1, 2000-11, pp. : 61-101

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On temporal logic versus datalog

By Guessarian I.   Foustoucos E.   Andronikos T.   Afrati F.  

Theoretical Computer Science, Vol. 303, Iss. 1, 2003-06 ,pp. : 103-133

Elsevier

Access to resources Recommend Favorite

A probabilistic view of Datalog parallelization

By Lifschitz S.   Vianu V.  

Theoretical Computer Science, Vol. 190, Iss. 2, 1998-01 ,pp. : 211-239

Elsevier

Access to resources Recommend Favorite

Circumscribing datalog: expressive power and complexity

By Cadoli M.   Palopoli L.  

Theoretical Computer Science, Vol. 193, Iss. 1, 1998-02 ,pp. : 215-244

Elsevier

Access to resources Recommend Favorite

On the Equivalence of Recursive and Nonrecursive Datalog Programs

By Chaudhuri S.   Vardi M.Y.  

Journal of Computer and System Sciences, Vol. 54, Iss. 1, 1997-02 ,pp. : 61-78

Academic Press

Access to resources Recommend Favorite

Towards Tractable Algebras for Bags

By Grumbach S.   Milo T.  

Journal of Computer and System Sciences, Vol. 52, Iss. 3, 1996-06 ,pp. : 570-588

Academic Press

Access to resources Recommend Favorite