Modular stratification and magic sets for DATALOG programs with negation
- 2 April 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 161-171
- https://doi.org/10.1145/298514.298558
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Efficient bottom-up computation of queries on stratified databasesThe Journal of Logic Programming, 1991
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Inference of monotonicity constraints in datalog programsPublished by Association for Computing Machinery (ACM) ,1989
- Logic programming as constructivism: a formalization and its application to databasesPublished by Association for Computing Machinery (ACM) ,1989
- Bottom-up beats top-down for datalogPublished by Association for Computing Machinery (ACM) ,1989
- On the power of magicPublished by Association for Computing Machinery (ACM) ,1987
- An amateur's introduction to recursive query processing strategiesPublished by Association for Computing Machinery (ACM) ,1986