{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:27Z","timestamp":1760202687940,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T00:00:00Z","timestamp":1408060800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this paper we study the expressive power of Horn-formulae in dependence\nlogic and show that they can express NP-complete problems. Therefore we define\nan even smaller fragment D-Horn* and show that over finite successor structures\nit captures the complexity class P of all sets decidable in polynomial time.\nFurthermore we study the question which of our results can ge generalized to\nthe case of open formulae of D-Horn* and so-called downwards monotone\npolynomial time properties of teams.<\/jats:p>","DOI":"10.2168\/lmcs-10(3:3)2014","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T09:40:57Z","timestamp":1415958057000},"source":"Crossref","is-referenced-by-count":4,"title":["A Fragment of Dependence Logic Capturing Polynomial Time"],"prefix":"10.46298","volume":"Volume 10, Issue 3","author":[{"given":"Johannes","family":"Ebbing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0115-5154","authenticated-orcid":false,"given":"Juha","family":"Kontinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian-Steffen","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9292-1960","authenticated-orcid":false,"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2014,8,15]]},"reference":[{"key":"918:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/795\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/795\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:56:17Z","timestamp":1681242977000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,15]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(3:3)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1210.3321","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1210.3321","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1903.10706","asserted-by":"subject"},{"id-type":"doi","id":"10.1007\/978-3-662-59533-6_19","asserted-by":"subject"},{"id-type":"doi","id":"10.1016\/j.ic.2021.104759","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1903.10706","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2014,8,15]]},"article-number":"795"}}