BibTeX
CSL-JSON
MLA
Harvard
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
arXiv
1210.3321v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links