A Fragment of Dependence Logic Capturing Polynomial Time release_4eyimez6w5dolpa3r7kvjgchlq

by Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller (Leibniz Universität Hannover), Heribert Vollmer

Released as a article .

2012  

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.
In text/plain format

Archived Files and Locations

application/pdf  167.0 kB
file_57zrpa44cvbkvhjvy7ycg22r3a
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2012-10-11
Version   v1
Language   en ?
arXiv  1210.3321v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 4f5469ae-3b9d-4394-8889-20a4c4d9a2c3
API URL: JSON