Foundations of Declarative Data Analysis Using Limit Datalog Programs
Motivated by applications in declarative data analysis, we study $Datalog$<sub>Z</sub>—an extension of positive Datalog with arithmetic functions over integers. This language is known to be undecidable, so we propose two fragments. In $limit$ $Datalog$<sub>Z</sub> predicates...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference item |
| Published: |
AAAI Press / International Joint Conferences on Artificial Intelligence
2017
|