{"id":"https://openalex.org/W2069504147","doi":"https://doi.org/10.1109/sisy.2013.6662583","title":"How to generate weakly nondecisive SAT instances","display_name":"How to generate weakly nondecisive SAT instances","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2069504147","doi":"https://doi.org/10.1109/sisy.2013.6662583","mag":"2069504147"},"language":"en","primary_location":{"id":"doi:10.1109/sisy.2013.6662583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sisy.2013.6662583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 11th International Symposium on Intelligent Systems and Informatics (SISY)","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/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\u00e1zy K\u00e1roly College, Eger Institute of Mathematics and Informatics","Inst. of Math. & Inf., Eszterhazy Karoly Coll., Eger, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eszterh\u00e1zy K\u00e1roly College, Eger Institute of Mathematics and Informatics","institution_ids":["https://openalex.org/I120832542"]},{"raw_affiliation_string":"Inst. of Math. & Inf., Eszterhazy Karoly Coll., Eger, Hungary","institution_ids":["https://openalex.org/I120832542"]}]},{"author_position":"middle","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\u00e1zy K\u00e1roly College, Eger Institute of Mathematics and Informatics","Inst. of Math. & Inf., Eszterhazy Karoly Coll., Eger, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eszterh\u00e1zy K\u00e1roly College, Eger Institute of Mathematics and Informatics","institution_ids":["https://openalex.org/I120832542"]},{"raw_affiliation_string":"Inst. of Math. & Inf., Eszterhazy Karoly Coll., Eger, Hungary","institution_ids":["https://openalex.org/I120832542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047580824","display_name":"Tibor Tajti","orcid":"https://orcid.org/0000-0001-8057-2962"},"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":"Tibor Tajti","raw_affiliation_strings":["Eszterh\u00e1zy K\u00e1roly College, Eger Institute of Mathematics and Informatics","Inst. of Math. & Inf., Eszterhazy Karoly Coll., Eger, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eszterh\u00e1zy K\u00e1roly College, Eger Institute of Mathematics and Informatics","institution_ids":["https://openalex.org/I120832542"]},{"raw_affiliation_string":"Inst. of Math. & Inf., Eszterhazy Karoly Coll., 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.3725,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65974223,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"1166","issue":null,"first_page":"265","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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.9993000030517578,"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/T10126","display_name":"Logic, programming, and type systems","score":0.995199978351593,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9936000108718872,"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/negation","display_name":"Negation","score":0.8451957702636719},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.7172176837921143},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.644437313079834},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6187450885772705},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5461753606796265},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5326492190361023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48168501257896423},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4653288722038269},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4378047287464142},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4312952756881714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42847323417663574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3340560793876648},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08041125535964966}],"concepts":[{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.8451957702636719},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.7172176837921143},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.644437313079834},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6187450885772705},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5461753606796265},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5326492190361023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48168501257896423},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4653288722038269},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4378047287464142},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4312952756881714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42847323417663574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3340560793876648},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08041125535964966},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/sisy.2013.6662583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sisy.2013.6662583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 11th International Symposium on Intelligent Systems and Informatics (SISY)","raw_type":"proceedings-article"},{"id":"pmh:oai:dea.lib.unideb.hu:2437/289407","is_oa":false,"landing_page_url":"http://hdl.handle.net/2437/289407","pdf_url":null,"source":{"id":"https://openalex.org/S4306402089","display_name":"University of Debrecen Electronic Archive (University of Debrecen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132735039","host_organization_name":"University of Debrecen","host_organization_lineage":["https://openalex.org/I132735039"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"el\u0151ad\u00e1skivonat"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1583135763","https://openalex.org/W2021870295","https://openalex.org/W2044560939","https://openalex.org/W2066749637","https://openalex.org/W2119190805","https://openalex.org/W2133527541","https://openalex.org/W2142785340","https://openalex.org/W4245630182","https://openalex.org/W4285719527","https://openalex.org/W6677909860","https://openalex.org/W6679878532"],"related_works":["https://openalex.org/W2480084299","https://openalex.org/W2014111643","https://openalex.org/W3107131366","https://openalex.org/W2571882453","https://openalex.org/W4211028879","https://openalex.org/W2076399409","https://openalex.org/W3128448798","https://openalex.org/W4248235708","https://openalex.org/W2408080066","https://openalex.org/W1608133301"],"abstract_inverted_index":{"In":[0],"this":[1,178],"paper":[2],"we":[3,25],"solve":[4],"a":[5,23,27,42,45,50,128],"problem":[6,13],"which":[7,33,184],"was":[8],"unsolved":[9],"until":[10],"now.":[11],"The":[12],"is:":[14],"How":[15],"to":[16,72],"generate":[17],"weakly":[18,35,102],"nondecisive":[19,36,103],"SAT":[20,116,182,189,197],"instances?":[21],"As":[22],"solution":[24],"introduce":[26],"very":[28],"simple":[29],"algorithm,":[30],"called":[31],"WnDGen,":[32],"generates":[34,59],"clause":[37,43,51,98],"sets.":[38],"Its":[39],"input":[40],"is":[41,49,100,127,162,172],"and":[44,104,108,145,150],"number,":[46],"its":[47],"output":[48],"set.":[52],"WnDGen(C,":[53,120,143],"k)":[54,144],"works":[55],"as":[56],"follows:":[57],"It":[58],"all":[60],"k-length":[61],"subsets":[62],"of":[63,91,110,114,135,142,148,152],"C.":[64,92],"For":[65],"each":[66],"subset":[67],"it":[68,84],"adds":[69],"k":[70],"clauses":[71],"the":[73,81,86,89,96,115,133,140,146,170],"output,":[74],"negating":[75],"every":[76],"time":[77],"another":[78],"literal":[79],"in":[80],"subset.":[82],"Then":[83],"does":[85],"same":[87],"with":[88],"negation":[90,109,151],"We":[93,122,174],"show":[94,124,175],"that":[95,125,176],"resulting":[97],"set":[99,147],"always":[101],"satisfiable.":[105,173],"Actually,":[106],"G":[107,111],"are":[112,181,185,193],"solutions":[113],"instance":[117],"generated":[118],"by":[119],"k).":[121],"also":[123],"there":[126,180],"threshold:":[129],"Let":[130],"n":[131,155,165],"be":[132,139],"length":[134],"C;":[136,153],"let":[137],"S":[138,161,171],"union":[141],"C":[149],"if":[154,164],"\u2265":[156],"2k":[157,167],"-":[158,168],"3,":[159,169],"then":[160],"unsatisfiable,":[163],"<;":[166],"around":[177],"threshold":[179],"instances,":[183],"difficult":[186],"for":[187,195],"state-of-the-art":[188],"solvers,":[190],"i.e.,":[191],"they":[192],"good":[194],"testing":[196],"solvers.":[198]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}