Boundedness is undecidable for datalog programs with a single recursive rule
- 3 October 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 32 (6) , 281-287
- https://doi.org/10.1016/0020-0190(89)90019-7
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Decidability and expressiveness aspects of logic queriesPublished by Association for Computing Machinery (ACM) ,1987
- Parallel evaluation of recursive rule queriesPublished by Association for Computing Machinery (ACM) ,1985
- Data independent recursion in deductive databasesPublished by Association for Computing Machinery (ACM) ,1985
- On computing restricted projections of representative instancesPublished by Association for Computing Machinery (ACM) ,1985
- On the foundations of the universal relation modelACM Transactions on Database Systems, 1984