A Fragment of Dependence Logic Capturing Polynomial Time
Logic in Computer Science
2015-07-01 v5 Computational Complexity
Abstract
In this paper we study the expressive power of Horn-formulae in dependence logic and show that they can express NP-complete problems. Therefore we define an even smaller fragment D-Horn* and show that over finite successor structures it captures the complexity class P of all sets decidable in polynomial time. Furthermore we study the question which of our results can ge generalized to the case of open formulae of D-Horn* and so-called downwards monotone polynomial time properties of teams.
Cite
@article{arxiv.1210.3321,
title = {A Fragment of Dependence Logic Capturing Polynomial Time},
author = {Johannes Ebbing and Juha Kontinen and Julian-Steffen Müller and Heribert Vollmer},
journal= {arXiv preprint arXiv:1210.3321},
year = {2015}
}