Foundations of Declarative Data Analysis Using Limit Datalog Programs.
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2021
- Type
- E - Conference contribution
- DOI
-
10.24963/ijcai.2017/156
- Title of conference / published proceedings
- CoRR
- First page
- 1123
- Volume
- abs/1705.06927
- Issue
- -
- ISSN
- 1045-0823
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper received the IJCAI 2017 Distinguished Paper award. It proposes the first extension of Datalog with integer arithmetic that has decidable fact entailment while allowing for recursive numerical value invention. This is highly desirable as recursive languages with arithmetic are a promising foundation for declarative data analysis, underpinning existing systems such as BOOM Analytics, DeALS, Myria, SociaLite, Dyna, and Yedalog. As demonstrated in the paper, the proposed language constitutes a unifying logical framework for declarative data analysis which can help to understand the expressive power and computational complexity of existing languages.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -