A Fragment of Dependence Logic Capturing Polynomial Time
Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller, Heribert Vollmer · Logical Methods in Computer Science · 2014
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.