{"id":"https://openalex.org/W2034069868","doi":"https://doi.org/10.1137/s0097539795285114","title":"The Inverse Satisfiability Problem","display_name":"The Inverse Satisfiability Problem","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2034069868","doi":"https://doi.org/10.1137/s0097539795285114","mag":"2034069868"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795285114","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795285114","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5111740824","display_name":"Dimitris J. Kavvadias","orcid":null},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Dimitris Kavvadias","raw_affiliation_strings":["Department of Mathematics, University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072492889","display_name":"Martha Sideri","orcid":null},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Martha Sideri","raw_affiliation_strings":["Dept. of Comput. Sci., Athens Univ. of Econ. & Bus., Athens, Greece"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., Athens Univ. of Econ. & Bus., Athens, Greece","institution_ids":["https://openalex.org/I73142707"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111740824"],"corresponding_institution_ids":["https://openalex.org/I174878644"],"apc_list":null,"apc_paid":null,"fwci":2.141,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.88873591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"28","issue":"1","first_page":"152","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9994999766349792,"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/mathematics","display_name":"Mathematics","score":0.741533100605011},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.7036154866218567},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6672766208648682},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6082562208175659},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5410801768302917},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5332583785057068},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5155732035636902},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5009374618530273},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4849115014076233},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.48107171058654785},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4730353057384491},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.4464350938796997},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43147796392440796},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.3647627830505371},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2249138355255127},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14458531141281128},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09961739182472229},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.06790924072265625}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.741533100605011},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.7036154866218567},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6672766208648682},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6082562208175659},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5410801768302917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5332583785057068},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5155732035636902},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5009374618530273},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4849115014076233},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.48107171058654785},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4730353057384491},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.4464350938796997},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43147796392440796},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3647627830505371},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2249138355255127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14458531141281128},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09961739182472229},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.06790924072265625},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":1,"locations":[{"id":"doi:10.1137/s0097539795285114","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795285114","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W3429031","https://openalex.org/W244748911","https://openalex.org/W1484529399","https://openalex.org/W1546514315","https://openalex.org/W1963547452","https://openalex.org/W1971132311","https://openalex.org/W2007940874","https://openalex.org/W2011039300","https://openalex.org/W2012170877","https://openalex.org/W2018830344","https://openalex.org/W2021015114","https://openalex.org/W2024768126","https://openalex.org/W2036265926","https://openalex.org/W2089296451","https://openalex.org/W2091345559","https://openalex.org/W2155322595","https://openalex.org/W2156017259","https://openalex.org/W2166566648","https://openalex.org/W2799061192","https://openalex.org/W2945259913"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W2394616262","https://openalex.org/W2480084299","https://openalex.org/W3152212242","https://openalex.org/W2963321374","https://openalex.org/W2408080066","https://openalex.org/W2014111643","https://openalex.org/W2406837904","https://openalex.org/W2571882453","https://openalex.org/W4211028879"],"abstract_inverted_index":{"We":[0,27,51],"study":[1],"the":[2,12,30,35,59,68,80],"complexity":[3],"of":[4,9,14,19,23],"telling":[5],"whether":[6],"a":[7,20,24,54],"set":[8,13],"bit-vectors":[10],"represents":[11],"all":[15,84,87,90,93],"satisfying":[16],"truth":[17],"assignments":[18],"Boolean":[21],"expression":[22,36],"certain":[25],"type.":[26],"show":[28],"that":[29],"problem":[31,69],"is":[32,37],"coNP-complete":[33],"when":[34],"required":[38],"to":[39,58,95],"be":[40,71],"in":[41,73],"conjunctive":[42],"normal":[43],"form":[44],"with":[45],"three":[46],"literals":[47],"per":[48],"clause":[49],"(3CNF).":[50],"also":[52],"prove":[53],"dichotomy":[55],"theorem":[56],"analogous":[57],"classical":[60],"one":[61],"by":[62],"Schaefer,":[63],"stating":[64],"that,":[65],"unless":[66],"P=NP,":[67],"can":[70],"solved":[72],"polynomial":[74],"time":[75],"if":[76,79],"and":[77],"only":[78],"clauses":[81],"allowed":[82],"are":[83],"Horn,":[85],"or":[86,89,92],"anti-Horn,":[88],"2CNF,":[91],"equivalent":[94],"equations":[96],"modulo":[97],"two.":[98]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}