{"id":"https://openalex.org/W2088113003","doi":"https://doi.org/10.1145/2603088.2603103","title":"Achieving new upper bounds for the hypergraph duality problem through logic","display_name":"Achieving new upper bounds for the hypergraph duality problem through logic","publication_year":2014,"publication_date":"2014-07-14","ids":{"openalex":"https://openalex.org/W2088113003","doi":"https://doi.org/10.1145/2603088.2603103","mag":"2088113003"},"language":"en","primary_location":{"id":"doi:10.1145/2603088.2603103","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/1407.2912","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["University of Oxford, Oxford, UK","University of Oxford , Oxford , UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"University of Oxford , Oxford , UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066443441","display_name":"Enrico Malizia","orcid":"https://orcid.org/0000-0002-6780-4711"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enrico Malizia","raw_affiliation_strings":["D.I.M.E.S., Universit\u00e0 della Calabria, Rende (CS), Italy"],"affiliations":[{"raw_affiliation_string":"D.I.M.E.S., Universit\u00e0 della Calabria, Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050151740"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.4229,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.75713311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7499282360076904},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7340131998062134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7138235569000244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5918720364570618},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5827955007553101},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5372884273529053},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5248356461524963},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5088098645210266},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5085264444351196},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.4960225522518158},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.48833534121513367},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4699326455593109},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.46554526686668396},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4302060306072235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2538788914680481}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7499282360076904},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7340131998062134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7138235569000244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5918720364570618},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5827955007553101},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5372884273529053},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5248356461524963},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5088098645210266},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5085264444351196},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.4960225522518158},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.48833534121513367},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4699326455593109},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.46554526686668396},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4302060306072235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2538788914680481},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/2603088.2603103","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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)","raw_type":"proceedings-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/470a739e-3e7e-40d8-b068-fbc5a9f9ed3e","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85046792964&partnerID=8YFLogxK","pdf_url":"https://arxiv.org/abs/1407.2912","source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gottlob , G & Malizia , E 2018 , ' Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic ' , SIAM JOURNAL ON COMPUTING , vol. 47 , no. 2 , pp. 456-492 . https://doi.org/10.1137/15M1027267","raw_type":"article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.766.1612","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.766.1612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1407.2912.pdf","raw_type":"text"},{"id":"pmh:oai:cris.unibo.it:11585/788304","is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?doid=2603088.2603103","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:figshare.com:article/29737619","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal contribution"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:944ffa92-e435-4cdc-8b6d-b9eea9f9331d","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:944ffa92-e435-4cdc-8b6d-b9eea9f9331d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Conference"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:bfdc1228-570e-4911-9f84-6b7c3b0aad26","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:bfdc1228-570e-4911-9f84-6b7c3b0aad26","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Journal article"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/470a739e-3e7e-40d8-b068-fbc5a9f9ed3e","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85046792964&partnerID=8YFLogxK","pdf_url":"https://arxiv.org/abs/1407.2912","source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gottlob , G & Malizia , E 2018 , ' Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic ' , SIAM JOURNAL ON COMPUTING , vol. 47 , no. 2 , pp. 456-492 . https://doi.org/10.1137/15M1027267","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3195340199","display_name":null,"funder_award_id":"246858 (DIADEM)","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2088113003.pdf","grobid_xml":"https://content.openalex.org/works/W2088113003.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W4514142","https://openalex.org/W41330591","https://openalex.org/W1484529399","https://openalex.org/W1490189322","https://openalex.org/W1501399373","https://openalex.org/W1513731467","https://openalex.org/W1531519240","https://openalex.org/W1537230380","https://openalex.org/W1543515168","https://openalex.org/W1564907238","https://openalex.org/W1902941631","https://openalex.org/W1972004026","https://openalex.org/W1976127067","https://openalex.org/W2005389099","https://openalex.org/W2025271293","https://openalex.org/W2045519569","https://openalex.org/W2053540099","https://openalex.org/W2054784808","https://openalex.org/W2065895258","https://openalex.org/W2077053297","https://openalex.org/W2080947358","https://openalex.org/W2084095551","https://openalex.org/W2087134747","https://openalex.org/W2087502667","https://openalex.org/W2088113003","https://openalex.org/W2108309071","https://openalex.org/W2125227861","https://openalex.org/W2142133061","https://openalex.org/W2152927719","https://openalex.org/W2169245654","https://openalex.org/W2337710787","https://openalex.org/W2797886920","https://openalex.org/W2963908121","https://openalex.org/W4236835455","https://openalex.org/W6989206057"],"related_works":["https://openalex.org/W2970311880","https://openalex.org/W2073028890","https://openalex.org/W1981385397","https://openalex.org/W4236663059","https://openalex.org/W2024994589","https://openalex.org/W2125536734","https://openalex.org/W2199053348","https://openalex.org/W2074125075","https://openalex.org/W1629505938","https://openalex.org/W2105859078"],"abstract_inverted_index":{"The":[0],"hypergraph":[1],"duality":[2],"problem":[3,40,60,117,166],"Dual":[4],"is":[5,34,41,54,63,100,126],"defined":[6],"as":[7],"follows:":[8],"given":[9,47],"two":[10,46,160],"simple":[11],"hypergraphs":[12],"G":[13,26,33],"and":[14,112],"H,":[15],"decide":[16,44],"whether":[17,45],"H":[18],"consists":[19],"precisely":[20],"of":[21,25,37,76,84,129,140,191],"all":[22,77],"minimal":[23],"transversals":[24],"(in":[27],"which":[28,125,142],"case":[29],"we":[30,108,169],"say":[31],"that":[32,56,79,98,177],"the":[35,58,73,115,119,137,156],"dual":[36],"H).":[38],"This":[39],"equivalent":[42],"to":[43,61,136,144,179,196],"non-redundant":[48],"monotone":[49],"DNFs":[50],"are":[51],"dual.":[52],"It":[53,95],"known":[55],"DUAL,":[57],"complementary":[59],"Dual,":[62],"in":[64,101,159,201],"GC":[65],"(log2":[66],"n,":[67,103,123,131],"PTIME),":[68],"where":[69],"GC(f(n),":[70],"C)":[71],"denotes":[72],"complexity":[74,92,120],"class":[75,93,121],"problems":[78],"after":[80],"a":[81,127,171,188],"nondeterministic":[82,173],"guess":[83,180],"O(f(n))":[85],"bits":[86],"can":[87],"be":[88],"decided":[89],"(checked)":[90],"within":[91],"C.":[94],"was":[96],"conjectured":[97],"DUAL":[99,116,176],"GC(log2":[102,122,130],"LOGSPACE).":[104,132],"In":[105],"this":[106,110,192],"paper":[107],"prove":[109],"conjecture":[111],"actually":[113],"place":[114],"into":[118],"TC0)":[124],"subclass":[128],"We":[133,154,184],"here":[134],"refer":[135],"logtime-uniform":[138],"version":[139],"TC0,":[141],"corresponds":[143],"FO(COUNT),":[145],"i.e.,":[146],"first":[147],"order":[148],"logic":[149],"augmented":[150],"by":[151,187],"counting":[152],"quantifiers.":[153],"achieve":[155],"latter":[157],"bound":[158],"steps.":[161],"First,":[162],"based":[163],"on":[164],"existing":[165],"decomposition":[167],"methods,":[168],"develop":[170],"new":[172],"algorithm":[174],"for":[175],"requires":[178],"O(log2":[181],"n)":[182],"bits.":[183],"then":[185],"proceed":[186],"logical":[189],"analysis":[190],"algorithm,":[193],"allowing":[194],"us":[195],"formulate":[197],"its":[198],"deterministic":[199],"part":[200],"FO(COUNT).":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}