Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting from the facts or top-down starting from the query. For efficiency, top-down evaluation is extended with memoization of inferred facts, and bottom-up evaluation is performed after transformation...
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artikel |
| Taal: | English |
| Gepubliceerd in: |
Open Publishing Association
2019-09-01
|
| Reeks: | Electronic Proceedings in Theoretical Computer Science |
| Online toegang: | http://arxiv.org/pdf/1909.08246v1 |