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...
| 發表在: | Journal of the ACM 48, 5 (2001). |
|---|---|
| 主要作者: | |
| 格式: | Article |
| 語言: | English |
| 主題: |