{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:20:56Z","timestamp":1787498456711,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Region of Calabria"},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["246858 (DIADEM)"],"award-info":[{"award-number":["246858 (DIADEM)"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603103","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T09:21:45Z","timestamp":1406539305000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Achieving new upper bounds for the hypergraph duality problem through logic"],"prefix":"10.1145","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[{"name":"University of Oxford, Oxford, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enrico","family":"Malizia","sequence":"additional","affiliation":[{"name":"D.I.M.E.S., Universit\u00e0 della Calabria, Rende (CS), Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1157"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_17"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696307"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024605820527"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793258295"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1734064"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793250299"},{"key":"e_1_3_2_1_8_1","first-page":"549","volume-title":"Proc. of JELIA 2002","author":"Eiter T.","year":"2002","unstructured":"T. Eiter and G. Gottlob . Hypergraph transversal computation and related problems in Logic and AI. In S. Flesca, S. Greco, N. Leone, and G. Ianni, editors , Proc. of JELIA 2002 , pages 549 -- 564 , 2002 . T. Eiter and G. Gottlob. Hypergraph transversal computation and related problems in Logic and AI. In S. Flesca, S. Greco, N. Leone, and G. Ianni, editors, Proc. of JELIA 2002, pages 549--564, 2002."},{"key":"e_1_3_2_1_9_1","first-page":"197","volume-title":"Proc. of CSL 2003","author":"Eiter T.","year":"2003","unstructured":"T. Eiter and K. Makino . Generating all abductive explanations for queries on propositional Horn theories. In M. Baaz and J. A. Makowsky, editors , Proc. of CSL 2003 , pages 197 -- 211 , 2003 . T. Eiter and K. Makino. Generating all abductive explanations for queries on propositional Horn theories. In M. Baaz and J. A. Makowsky, editors, Proc. of CSL 2003, pages 197--211, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970240639X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.04.017"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.05.030"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0062"},{"key":"e_1_3_2_1_15_1","first-page":"322","volume-title":"Proc. of Canadian AI 2004","author":"Gaur D. R.","year":"2004","unstructured":"D. R. Gaur and R. Krishnamurti . Average case self-duality of monotone Boolean functions. In A. Y. Tawfik and S. D. Goodwin, editors , Proc. of Canadian AI 2004 , pages 322 -- 338 , 2004 . D. R. Gaur and R. Krishnamurti. Average case self-duality of monotone Boolean functions. In A. Y. Tawfik and S. D. Goodwin, editors, Proc. of Canadian AI 2004, pages 322--338, 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622788.1622790"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/235767.235769"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2463673"},{"issue":"4","key":"e_1_3_2_1_19_1","first-page":"385","article-title":"Investigations on Armstrong relations, dependency inference, and excluded functional dependencies","volume":"9","author":"Gottlob G.","year":"1990","unstructured":"G. Gottlob and L. Libkin . Investigations on Armstrong relations, dependency inference, and excluded functional dependencies . Acta Cybernetica , 9 ( 4 ): 385 -- 402 , 1990 . G. Gottlob and L. Libkin. Investigations on Armstrong relations, dependency inference, and excluded functional dependencies. Acta Cybernetica, 9(4):385--402, 1990.","journal-title":"Acta Cybernetica"},{"key":"e_1_3_2_1_20_1","volume-title":"Achieving new upper bounds for the hypergraph duality problem through logic. Technical report to appear shortly on arXiv.org","author":"Gottlob G.","year":"2014","unstructured":"G. Gottlob and E. Malizia . Achieving new upper bounds for the hypergraph duality problem through logic. Technical report to appear shortly on arXiv.org , 2014 . G. Gottlob and E. Malizia. Achieving new upper bounds for the hypergraph duality problem through logic. Technical report to appear shortly on arXiv.org, 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90079-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263684"},{"key":"e_1_3_2_1_23_1","volume-title":"Algorithmic and Computational Complexity Issues of MONET","author":"Hagen M.","year":"2008","unstructured":"M. Hagen . Algorithmic and Computational Complexity Issues of MONET . Cuvillier Verlag , G\u00f6ttingen, Germany , 2008 . M. Hagen. Algorithmic and Computational Complexity Issues of MONET. Cuvillier Verlag, G\u00f6ttingen, Germany, 2008."},{"key":"e_1_3_2_1_24_1","first-page":"49","volume-title":"Proc. of TACAS 2003","author":"Henzinger T. A.","year":"2003","unstructured":"T. A. Henzinger , O. Kupferman , and R. Majumdar . On the universal and existential fragments of the μ-calculus. In H. Garavel and J. Hatcliff, editors , Proc. of TACAS 2003 , pages 49 -- 64 , 2003 . T. A. Henzinger, O. Kupferman, and R. Majumdar. On the universal and existential fragments of the μ-calculus. In H. Garavel and J. Hatcliff, editors, Proc. of TACAS 2003, pages 49--64, 2003."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"N. Immerman. Descriptive Complexity. Springer-Verlag New York NY USA 1999.  N. Immerman. Descriptive Complexity . Springer-Verlag New York NY USA 1999.","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00150-1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00346-0"},{"key":"e_1_3_2_1_28_1","first-page":"399","volume-title":"Proc. of ISAAC '93","author":"Kavvadias D. J.","year":"1993","unstructured":"D. J. Kavvadias , C. H. Papadimitriou , and M. Sideri . On Horn envelopes and hypergraph transversals. In K.-W. Ng, P. Raghavan, N. V. Balasubramanian, and F. Y. L. Chin, editors , Proc. of ISAAC '93 , pages 399 -- 405 , 1993 . D. J. Kavvadias, C. H. Papadimitriou, and M. Sideri. On Horn envelopes and hypergraph transversals. In K.-W. Ng, P. Raghavan, N. V. Balasubramanian, and F. Y. L. Chin, editors, Proc. of ISAAC '93, pages 399--405, 1993."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90031-5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0169-023X(94)90023-X"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009796218281"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/267460.267500"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90062-2"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"H. Vollmer. Introduction to Circuit Complexity. Springer-Verlag Berlin Heidelberg Germany 1999.   H. Vollmer. Introduction to Circuit Complexity . Springer-Verlag Berlin Heidelberg Germany 1999.","DOI":"10.1007\/978-3-662-03927-4"}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","location":"Vienna Austria","acronym":"CSL-LICS '14","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:22:34Z","timestamp":1750263754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":33,"alternative-id":["10.1145\/2603088.2603103","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603103","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}