The Expressive Power of Higher-Order Datalog
Programming Languages
2020-02-19 v2 Computational Complexity
Databases
Logic in Computer Science
Abstract
A classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases. In this paper we extend this result to the case of higher-order Datalog. In particular, we demonstrate that on ordered databases, for all , -order Datalog captures -EXPTIME. This result suggests that higher-order extensions of Datalog possess superior expressive power and they are worthwhile of further investigation both in theory and in practice. This paper is under consideration for acceptance in TPLP.
Keywords
Cite
@article{arxiv.1907.09820,
title = {The Expressive Power of Higher-Order Datalog},
author = {Angelos Charalambidis and Christos Nomikos and Panos Rondogiannis},
journal= {arXiv preprint arXiv:1907.09820},
year = {2020}
}
Comments
Paper presented at the 35th International Conference on Logic Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019, 24 pages, LaTeX