Equivalence of Datalog queries is undecidable
- 28 February 1993
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 15 (3) , 231-241
- https://doi.org/10.1016/0743-1066(93)90040-n
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Optimizing datalog programsPublished by Association for Computing Machinery (ACM) ,1987
- Decidability and expressiveness aspects of logic queriesPublished by Association for Computing Machinery (ACM) ,1987
- Parallel complexity of logical query programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979