Argument reduction by factoring
- 24 July 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 146 (1-2) , 269-310
- https://doi.org/10.1016/0304-3975(94)00186-m
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Magic templates: a spellbinding approach to logic programsThe Journal of Logic Programming, 1991
- Efficient evaluation of right-, left-, and multi-linear rulesACM SIGMOD Record, 1989
- Compiling separable recursionsACM SIGMOD Record, 1988
- Optimizing existential datalog queriesPublished by Association for Computing Machinery (ACM) ,1988
- Optimizing Datalog ProgramsPublished by Elsevier ,1988
- One-sided recursionsPublished by Association for Computing Machinery (ACM) ,1987
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Strong equivalence of relational expressions under dependenciesInformation Processing Letters, 1982
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976