Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/ipl/LeungRHTG95
%A Leung, Hing
%A Ranjan, Desh
%A Hernández, Héctor J.
%A Tang, D. T.
%A González, Agustin
%D 1995
%J Inf. Process. Lett.
%K dblp
%N 5
%P 279-282
%T A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs.
%U http://dblp.uni-trier.de/db/journals/ipl/ipl55.html#LeungRHTG95
%V 55
@article{journals/ipl/LeungRHTG95,
added-at = {2003-11-20T00:00:00.000+0100},
author = {Leung, Hing and Ranjan, Desh and Hernández, Héctor J. and Tang, D. T. and González, Agustin},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/24b0e9fbf683a7987c026043ce70f201e/dblp},
ee = {http://dx.doi.org/10.1016/0020-0190(95)00097-V},
interhash = {daea2e6b07903160dc4cf01b4dc9fe93},
intrahash = {4b0e9fbf683a7987c026043ce70f201e},
journal = {Inf. Process. Lett.},
keywords = {dblp},
number = 5,
pages = {279-282},
timestamp = {2016-02-02T04:35:11.000+0100},
title = {A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs.},
url = {http://dblp.uni-trier.de/db/journals/ipl/ipl55.html#LeungRHTG95},
volume = 55,
year = 1995
}