The Expressive Power of Higher-Order Datalog

by   Angelos Charalambidis, et al.
NCSR Demokritos
Fedora Summer University
University of Athens

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 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. This work is under consideration for publication in Theory and Practices of Logic Programming.


page 1

page 2

page 3

page 4


A Tale of Two Set Theories

We describe the relationship between two versions of Tarski-Grothendieck...

Extensional Higher-Order Logic Programming

We propose a purely extensional semantics for higher-order logic program...

Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation

Extensional higher-order logic programming has been introduced as a gene...

Capturing Bisimulation-Invariant Exponential-Time Complexity Classes

Otto's Theorem characterises the bisimulation-invariant PTIME queries ov...

An Expressive Probabilistic Temporal Logic

This paper argues that a combined treatment of probabilities, time and a...

Non-deterministic Characterisations

In this paper, we extend Jones' result -- that cons-free programming wit...

Wetzel: Formalisation of an Undecidable Problem Linked to the Continuum Hypothesis

In 1964, Paul Erdős published a paper settling a question about function...

Please sign up or login with your details

Forgot password? Click here to reset