{"id":"https://openalex.org/W3036523364","doi":"https://doi.org/10.1109/saci49304.2020.9118786","title":"Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems","display_name":"Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems","publication_year":2020,"publication_date":"2020-05-01","ids":{"openalex":"https://openalex.org/W3036523364","doi":"https://doi.org/10.1109/saci49304.2020.9118786","mag":"3036523364"},"language":"en","primary_location":{"id":"doi:10.1109/saci49304.2020.9118786","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci49304.2020.9118786","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 14th International Symposium on Applied Computational Intelligence and Informatics (SACI)","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/A5078475872","display_name":"G\u00e1bor Kusper","orcid":"https://orcid.org/0000-0001-6969-1629"},"institutions":[{"id":"https://openalex.org/I120832542","display_name":"Eszterhazy Karoly Catholic University","ror":"https://ror.org/004gfgx38","country_code":"HU","type":"education","lineage":["https://openalex.org/I120832542"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Gabor Kusper","raw_affiliation_strings":["Eszterházy Károly University,Faculty of Informatics,Eger,Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eszterházy Károly University,Faculty of Informatics,Eger,Hungary","institution_ids":["https://openalex.org/I120832542"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090729699","display_name":"Csaba B\u00edr\u00f3","orcid":"https://orcid.org/0000-0001-8561-9141"},"institutions":[{"id":"https://openalex.org/I120832542","display_name":"Eszterhazy Karoly Catholic University","ror":"https://ror.org/004gfgx38","country_code":"HU","type":"education","lineage":["https://openalex.org/I120832542"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Csaba Biro","raw_affiliation_strings":["Eszterházy Károly University,Faculty of Informatics,Eger,Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eszterházy Károly University,Faculty of Informatics,Eger,Hungary","institution_ids":["https://openalex.org/I120832542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048197698","display_name":"Tam\u00e1s Balla","orcid":null},"institutions":[{"id":"https://openalex.org/I120832542","display_name":"Eszterhazy Karoly Catholic University","ror":"https://ror.org/004gfgx38","country_code":"HU","type":"education","lineage":["https://openalex.org/I120832542"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Tamas Balla","raw_affiliation_strings":["Eszterházy Károly University,Faculty of Informatics,Eger,Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eszterházy Károly University,Faculty of Informatics,Eger,Hungary","institution_ids":["https://openalex.org/I120832542"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I120832542"],"apc_list":null,"apc_paid":null,"fwci":0.4372,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68729392,"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":"000227","last_page":"000234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9894000291824341,"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.9894000291824341,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9711999893188477,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.6548949480056763},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5545465350151062},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5142359137535095},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5006015300750732},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39823776483535767}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6548949480056763},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5545465350151062},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5142359137535095},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5006015300750732},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39823776483535767}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/saci49304.2020.9118786","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci49304.2020.9118786","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 14th International Symposium on Applied Computational Intelligence and Informatics (SACI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1975335740","https://openalex.org/W2028206183","https://openalex.org/W2031823362","https://openalex.org/W2075410688","https://openalex.org/W2080267935","https://openalex.org/W2118382442","https://openalex.org/W2279051810","https://openalex.org/W2296553656","https://openalex.org/W2555026456","https://openalex.org/W2902292667","https://openalex.org/W2921616933","https://openalex.org/W2995524153"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2912612369"],"abstract_inverted_index":{"In":[0,89],"our":[1],"previous":[2],"works":[3],"we":[4,82,93,105,112,130],"introduced":[5,84],"several":[6],"2-SAT":[7],"(Strong":[8],"Model)":[9,19],"and":[10,16,35,104,138],"3-SAT":[11,32],"(Weak":[12],"Model,":[13],"Balatonbogl\u00e1r":[14,18,27,45,87],"Model":[15,28,46],"Simplified":[17,86],"models":[20],"of":[21,50,59,116,120,136,141,148,151],"directed":[22,40,61,154],"graphs.":[23],"We":[24],"showed":[25],"that":[26],"is":[29,42,74],"a":[30,48,146],"Black-and-White":[31],"problem":[33],"if":[34,37],"only":[36],"the":[38,60,85,99,108,114,117,133,139,149,152],"represented":[39,153],"graph":[41,62],"strongly":[43],"connected.":[44],"generates":[47],"lot":[49],"so":[51],"called":[52],"Negative-Negative-Positive":[53],"shaped":[54],"clauses":[55,143],"to":[56,97],"represent":[57],"cycles":[58],"without":[63],"detecting":[64],"cycles,":[65],"i.e.,":[66],"it":[67,73],"can":[68],"be":[69],"generated":[70,124],"fast":[71],"but":[72],"bigger":[75],"than":[76],"necessary.":[77],"To":[78],"overcome":[79],"this":[80,90],"problem,":[81],"have":[83],"Model.":[88],"article,":[91],"first,":[92],"give":[94],"an":[95],"example":[96],"illustrate":[98],"various":[100],"conversion":[101,127],"methods":[102],"(models)":[103],"briefly":[106],"explain":[107],"theoretical":[109],"background.":[110],"After,":[111],"present":[113],"results":[115],"latest":[118],"version":[119],"CSFLOC":[121],"on":[122],"benchmarks":[123,137],"by":[125],"different":[126],"models.":[128],"Finally,":[129],"show":[131],"how":[132],"file":[134],"sizes":[135],"number":[140],"unused":[142],"changes":[144],"as":[145],"function":[147],"density":[150],"graph.":[155]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}