On the Equivalence of Recursive and Nonrecursive Datalog Programs

Author： Chaudhuri S.   Vardi M.Y.  

Publisher： Academic Press

ISSN： 0022-0000

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

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

Abstract

Related content

Learning classes of approximations to non-recursive functions

By Stephan F.   Zeugmann T.  

Theoretical Computer Science, Vol. 288, Iss. 2, 2002-10 ,pp. : 309-341

Elsevier

Access to resources Recommend Favorite

A semantic approach to optimize linear datalog programs

By Paramá José   Brisaboa Nieves   Penabad Miguel   Places Ángeles  

Acta Informatica, Vol. 43, Iss. 5, 2006-12 ,pp. : 341-370

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Adaptive and Dynamic Mesh Refinement Based on a Non-recursive Strategy

By Bo M.   Amor M.   Concheiro R.   Doggett M.  

Computer Journal, Vol. 56, Iss. 7, 2013-07 ,pp. : 843-851

Oxford University Press

Access to resources Recommend Favorite

Fusion of recursive programs with computational effects

By Pardo A.  

Theoretical Computer Science, Vol. 260, Iss. 1, 2001-06 ,pp. : 165-207

Elsevier

Access to resources Recommend Favorite

A coinductive completeness proof for the equivalence of recursive types

By Cardone  

Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. : 575-587

Elsevier

Access to resources Recommend Favorite