Abstract
AbstractA classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases (Papadimitriou 1985; Grädel 1992; Vardi 1982; Immerman 1986; Leivant 1989). In this paper we extend this result to the case of higher-order Datalog. In particular, we demonstrate that on ordered databases, for all k ≥ 2, k-order Datalog captures (k − 1)-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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference18 articles.
1. Capturing complexity classes by fragments of second-order logic;Grädel;Theoretical Computer Science 101,1992
2. Descriptive characterizations of computational complexity;Leivant;Journal of Computer and System Science 39,1989
3. Lovrenčić, A. and Čubrilo, M. 1999. Amalgamation of heterogeneous data sources using amalgamated annotated hilog. In 3rd international IEEE Conference on Intelligent Engineering Systems (INES’99).
4. Papadimitriou, C. H. 1985. A note on the expressive power of prolog. Bulletin of the EATCS 26, 21–22.
5. Miller, D. and Nadathur, G. 1986. Higher-order logic programming. In Proceedings of the Third International Conference on Logic Programming (ICLP). 448–462.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Higher-Order MSL Horn Constraints;Proceedings of the ACM on Programming Languages;2023-01-09
2. Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29