Static analysis in datalog extensions.

We consider the problems of containment, equivalence, satisfiability and query-reachability for datalog programs with negation. These problems are important for optimizing datalog programs. We show that both query-reachability and satisfiability are decidable for programs with stratified negation pr...

Full beskrivning

Bibliografiska uppgifter

I publikationen:	Journal of the ACM 48, 5 (2001).
Huvudupphovsman:	Halevy, Alon Y.
Materialtyp:	Artikel
Språk:	English
Ämnen:	Theory of computation. Logics and meanings of programs. Specifying and Verifying and Reasoning about Programs. Information systems. Database management. Languages. Algorithms. Theory. Verification.