Bounds on the propagation of selection into logic programs
- 1 June 1987
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 7, 214-226
- https://doi.org/10.1145/28659.28683
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Implementation of logical query languages for databasesACM Transactions on Database Systems, 1985
- 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
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960