Proof-tree transformation theorems and their applications
- 29 March 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 172-181
- https://doi.org/10.1145/73721.73739
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Linearising nonlinear recursions in polynomial timePublished by Association for Computing Machinery (ACM) ,1989
- Compiling separable recursionsPublished by Association for Computing Machinery (ACM) ,1988
- 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 evaluation of recursive rule queriesPublished by Association for Computing Machinery (ACM) ,1985
- On the implementation of a simple class of logic queries for databasesPublished by Association for Computing Machinery (ACM) ,1985
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Embedded implicational dependencies and their inference problemPublished by Association for Computing Machinery (ACM) ,1981
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977