The expressive power of revised Datalog on problems with closure properties
Logic in Computer Science
2023-08-09 v2
Abstract
In this paper, we study the expressive power of revised Datalog on the problems that are closed under substructures. We show that revised Datalog cannot define all the problems that are in PTIME and closed under substructures. As a corollary, LFP cannot define all the extension-closed problems that are in PTIME.
Keywords
Cite
@article{arxiv.1403.6611,
title = {The expressive power of revised Datalog on problems with closure properties},
author = {Shiguang Feng},
journal= {arXiv preprint arXiv:1403.6611},
year = {2023}
}