{"id":"https://openalex.org/W3182554853","doi":"https://doi.org/10.1109/lics52264.2021.9470502","title":"Towards a more efficient approach for the satisfiability of two-variable logic","display_name":"Towards a more efficient approach for the satisfiability of two-variable logic","publication_year":2021,"publication_date":"2021-06-29","ids":{"openalex":"https://openalex.org/W3182554853","doi":"https://doi.org/10.1109/lics52264.2021.9470502","mag":"3182554853"},"language":"en","primary_location":{"id":"doi:10.1109/lics52264.2021.9470502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102949108","display_name":"Ting\u2010Wei Lin","orcid":"https://orcid.org/0000-0001-9594-8854"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ting-Wei Lin","raw_affiliation_strings":["National Taiwan University"],"affiliations":[{"raw_affiliation_string":"National Taiwan University","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069796117","display_name":"Chia-Hsuan Lu","orcid":"https://orcid.org/0009-0008-5446-9150"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chia-Hsuan Lu","raw_affiliation_strings":["National Taiwan University"],"affiliations":[{"raw_affiliation_string":"National Taiwan University","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060686021","display_name":"Tony Tan","orcid":"https://orcid.org/0009-0005-8341-2004"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tony Tan","raw_affiliation_strings":["National Taiwan University"],"affiliations":[{"raw_affiliation_string":"National Taiwan University","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102949108"],"corresponding_institution_ids":["https://openalex.org/I16733864"],"apc_list":null,"apc_paid":null,"fwci":0.5919,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71414794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9922999739646912,"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/T11567","display_name":"semigroups and automata theory","score":0.9916999936103821,"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/satisfiability","display_name":"Satisfiability","score":0.5697829723358154},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4708896279335022},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46419087052345276},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4018070101737976},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38478368520736694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3796669840812683}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5697829723358154},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4708896279335022},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46419087052345276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4018070101737976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38478368520736694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3796669840812683}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics52264.2021.9470502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309618","display_name":"Ministry of Science and Technology","ror":"https://ror.org/02b207r52"},{"id":"https://openalex.org/F4320323900","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W105203805","https://openalex.org/W282603215","https://openalex.org/W1483892218","https://openalex.org/W1517995365","https://openalex.org/W1527044402","https://openalex.org/W1568972291","https://openalex.org/W1590283810","https://openalex.org/W1608479762","https://openalex.org/W1982538209","https://openalex.org/W1993151238","https://openalex.org/W1997817571","https://openalex.org/W2013568176","https://openalex.org/W2014111643","https://openalex.org/W2027602125","https://openalex.org/W2029948740","https://openalex.org/W2043360684","https://openalex.org/W2049136377","https://openalex.org/W2065939997","https://openalex.org/W2080220005","https://openalex.org/W2086470346","https://openalex.org/W2089417393","https://openalex.org/W2116007667","https://openalex.org/W2124322005","https://openalex.org/W2124580444","https://openalex.org/W2126442135","https://openalex.org/W2160429376","https://openalex.org/W2189181601","https://openalex.org/W2295428206","https://openalex.org/W2329095262","https://openalex.org/W2952270385","https://openalex.org/W2964224456","https://openalex.org/W3033601567","https://openalex.org/W3182554853","https://openalex.org/W4231916799","https://openalex.org/W4236835455","https://openalex.org/W4241108585","https://openalex.org/W4299490515","https://openalex.org/W4301431527","https://openalex.org/W6610200006","https://openalex.org/W6727939487","https://openalex.org/W6779664804","https://openalex.org/W6794433903"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3037419933","https://openalex.org/W44982509","https://openalex.org/W2952234674","https://openalex.org/W1543051890","https://openalex.org/W4299809933"],"abstract_inverted_index":{"We":[0,68,212],"revisit":[1],"the":[2,116,135,149,150,176,181,185,192,228,233,236,247,250,265],"satisfiability":[3],"problem":[4,60],"for":[5,79,142,196],"two-variable":[6],"logic,":[7],"denoted":[8],"by":[9,53],"SAT(FO":[10,119,143],"<sup":[11,96,101,107,120,144,157,162,168,208,222],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[12,97,102,108,121,145,158,163,169,209,223],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[13,122,146,224],"),":[14,99,110,160,171],"which":[15,225],"is":[16,24,41,72,124,175],"known":[17,30],"to":[18,56,128,227,246],"be":[19,38],"NEXP-complete.":[20],"The":[21,253],"upper":[22],"bound":[23],"usually":[25],"derived":[26],"from":[27],"its":[28],"well":[29],"exponential":[31],"size":[32],"model":[33],"property.":[34],"Whether":[35],"it":[36,55],"can":[37],"determinized/randomized":[39],"efficiently":[40],"still":[42],"an":[43,197],"open":[44],"question.In":[45],"this":[46],"paper":[47],"we":[48,62,239],"present":[49,75,240],"a":[50,57,215,241,260],"different":[51],"approach":[52],"reducing":[54],"novel":[58],"graph-theoretic":[59],"that":[61,70,114],"call":[63],"Conditional":[64],"Independent":[65],"Set":[66],"(CIS).":[67],"show":[69,113],"CIS":[71,129],"NP-complete":[73],"and":[74,86,105,166,258],"three":[76,137],"simple":[77,138],"algorithms":[78,139,195],"it:":[80],"Deterministic,":[81],"randomized":[82,87],"with":[83,88,92,153,201,235],"zero":[84],"error":[85],"small":[89,261],"one-sided":[90],"error,":[91],"run":[93,154],"time":[94,155,202,243],"O(1.4423":[95,156],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[98,103,109],"O(1.6181":[100,161],")":[104,123,147,165],"O(1.3661":[106,167],"respectively.We":[111],"then":[112],"without":[115,148,249],"equality":[117,151,237,251],"predicate":[118,152],"in":[125,130,180,264],"fact":[126],"equivalent":[127],"succinct":[131],"representation.":[132],"This":[133],"yields":[134,255],"same":[136],"as":[140],"above":[141],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(2n)</sup>":[159,164,170,210],"respectively,":[172],"where":[173],"n":[174],"number":[177,266],"of":[178,187,220,231,267],"predicates":[179],"input":[182],"formula.":[183],"To":[184],"best":[186],"our":[188],"knowledge,":[189],"these":[190],"are":[191],"first":[193],"deterministic/randomized":[194],"NEXP-complete":[198],"decidable":[199],"logic":[200],"complexity":[203,218],"significantly":[204],"lower":[205,217],"than":[206],"O(2":[207],").":[211],"also":[213],"identify":[214],"few":[216],"fragments":[219,230],"FO":[221],"correspond":[226],"tractable":[229],"CIS.For":[232],"fragment":[234,248],"predicate,":[238],"linear":[242],"many-one":[244],"reduction":[245,254],"predicate.":[252],"equi-satisfiable":[256],"formulas":[257],"incurs":[259],"constant":[262],"blow-up":[263],"predicates.":[268]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
