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). |
|---|---|
| मुख्य लेखक: | |
| स्वरूप: | लेख |
| भाषा: | अंग्रेज़ी |
| विषय: |