{"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":"conference-paper","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":false,"raw_author_name":"Ting-Wei Lin","raw_affiliation_strings":["National Taiwan University"],"raw_orcid":null,"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"],"raw_orcid":null,"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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Taiwan University","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16733864"],"apc_list":null,"apc_paid":null,"fwci":1.6193,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.82298942,"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":{"pdf":false,"grobid_xml":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,64,172],"revisit":[1],"the":[2,100,115,125,126,140,145,149,156,184,189,192,203,206,221],"satisfiability":[3],"problem":[4,56],"for":[5,75,122,160],"two-variable":[6],"logic,":[7],"denoted":[8],"by":[9,49],"SAT(FO2),":[10],"which":[11],"is":[12,20,37,68,104,139],"known":[13,26],"to":[14,52,108,183,202],"be":[15,34],"NEXP-complete.":[16],"The":[17,209],"upper":[18],"bound":[19],"usually":[21],"derived":[22],"from":[23],"its":[24],"well":[25],"exponential":[27],"size":[28],"model":[29],"property.":[30],"Whether":[31],"it":[32,51],"can":[33],"determinized/randomized":[35],"efficiently":[36],"still":[38],"an":[39,161],"open":[40],"question.In":[41],"this":[42],"paper":[43],"we":[44,58,195],"present":[45,71,196],"a":[46,53,175,197,216],"different":[47],"approach":[48],"reducing":[50],"novel":[54],"graph-theoretic":[55],"that":[57,66,98],"call":[59],"Conditional":[60],"Independent":[61],"Set":[62],"(CIS).":[63],"show":[65,97],"CIS":[67,109],"NP-complete":[69],"and":[70,82,93,134,214],"three":[72,117],"simple":[73,118],"algorithms":[74,119,159],"it:":[76],"Deterministic,":[77],"randomized":[78,83],"with":[79,84,88,129,165,191],"zero":[80],"error":[81],"small":[85,217],"one-sided":[86],"error,":[87],"run":[89,130],"time":[90,131,166,199],"O(1.4423n),":[91],"O(1.6181n)":[92],"O(1.3661n),":[94],"respectively.We":[95],"then":[96],"without":[99,124,205],"equality":[101,127,193,207],"predicate":[102,128],"SAT(FO2)":[103,123],"in":[105,110,144,220],"fact":[106],"equivalent":[107],"succinct":[111],"representation.":[112],"This":[113],"yields":[114,211],"same":[116],"as":[120],"above":[121],"O(1.4423(2n)),":[132],"O(1.6181(2n))":[133],"O(1.3661(2n)),":[135],"respectively,":[136],"where":[137],"n":[138],"number":[141,222],"of":[142,151,180,187,223],"predicates":[143],"input":[146],"formula.":[147],"To":[148],"best":[150],"our":[152],"knowledge,":[153],"these":[154],"are":[155],"first":[157],"deterministic/randomized":[158],"NEXP-complete":[162],"decidable":[163],"logic":[164],"complexity":[167,178],"significantly":[168],"lower":[169,177],"than":[170],"O(2(2n)).":[171],"also":[173],"identify":[174],"few":[176],"fragments":[179,186],"FO2which":[181],"correspond":[182],"tractable":[185],"CIS.For":[188],"fragment":[190,204],"predicate,":[194],"linear":[198],"many-one":[200],"reduction":[201,210],"predicate.":[208],"equi-satisfiable":[212],"formulas":[213],"incurs":[215],"constant":[218],"blow-up":[219],"predicates.":[224]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}