{"id":"https://openalex.org/W2025799810","doi":"https://doi.org/10.1145/1185448.1185456","title":"A SAT-based solver for Q-ALL SAT","display_name":"A SAT-based solver for Q-ALL SAT","publication_year":2006,"publication_date":"2006-03-10","ids":{"openalex":"https://openalex.org/W2025799810","doi":"https://doi.org/10.1145/1185448.1185456","mag":"2025799810"},"language":"en","primary_location":{"id":"doi:10.1145/1185448.1185456","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1185448.1185456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 44th annual Southeast regional conference","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/A5041719911","display_name":"B. Browning","orcid":null},"institutions":[{"id":"https://openalex.org/I5950314","display_name":"University of West Georgia","ror":"https://ror.org/01cqxk816","country_code":"US","type":"education","lineage":["https://openalex.org/I5950314"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B. Browning","raw_affiliation_strings":["University of West Georgia, Carrollton, Georgia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of West Georgia, Carrollton, Georgia","institution_ids":["https://openalex.org/I5950314"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081857149","display_name":"Anja Remshagen","orcid":"https://orcid.org/0000-0002-2011-1379"},"institutions":[{"id":"https://openalex.org/I5950314","display_name":"University of West Georgia","ror":"https://ror.org/01cqxk816","country_code":"US","type":"education","lineage":["https://openalex.org/I5950314"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Remshagen","raw_affiliation_strings":["University of West Georgia, Carrollton, Georgia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of West Georgia, Carrollton, Georgia","institution_ids":["https://openalex.org/I5950314"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.11256903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"30","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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.9988999962806702,"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.9944999814033508,"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.9922000169754028,"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/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7880739569664001},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7334408760070801},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6849795579910278},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6802012324333191},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.53424471616745},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5185461640357971},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4725843667984009},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4494738280773163},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.438934326171875},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4281126856803894},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41032010316848755},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3856968283653259},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3785499632358551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2610655426979065},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10200044512748718},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.09711205959320068},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08350628614425659}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7880739569664001},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7334408760070801},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6849795579910278},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6802012324333191},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.53424471616745},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5185461640357971},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4725843667984009},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4494738280773163},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.438934326171875},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4281126856803894},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41032010316848755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3856968283653259},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3785499632358551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2610655426979065},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10200044512748718},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.09711205959320068},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08350628614425659},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1185448.1185456","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1185448.1185456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 44th annual Southeast regional conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W47910446","https://openalex.org/W103439665","https://openalex.org/W170393372","https://openalex.org/W1483522989","https://openalex.org/W1511155470","https://openalex.org/W1597057550","https://openalex.org/W1862403209","https://openalex.org/W1916519491","https://openalex.org/W2005573219","https://openalex.org/W2012165860","https://openalex.org/W2054582708","https://openalex.org/W2067627899","https://openalex.org/W2096307462","https://openalex.org/W2100657934","https://openalex.org/W2911267893","https://openalex.org/W3004586442","https://openalex.org/W3098378096"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W2480084299","https://openalex.org/W2394616262","https://openalex.org/W2014111643","https://openalex.org/W2408080066","https://openalex.org/W2406837904","https://openalex.org/W192406999","https://openalex.org/W2571882453","https://openalex.org/W4211028879","https://openalex.org/W3120153087"],"abstract_inverted_index":{"Although":[0],"the":[1,32,38,73,87,97,104,116],"satisfiability":[2],"problem":[3],"(SAT)":[4],"is":[5,83,122],"NP-complete,":[6],"state-of-the-art":[7],"solvers":[8],"for":[9,62],"SAT":[10,64,68,77,98],"can":[11],"solve":[12,25],"instances":[13,90],"that":[14,49,65,91,107,120],"are":[15,92],"considered":[16],"to":[17,24,85,93],"be":[18,94],"very":[19,124],"hard.":[20],"Emerging":[21],"applications":[22],"demand":[23],"even":[26],"more":[27],"complex":[28],"problems":[29],"residing":[30],"at":[31],"second":[33],"or":[34],"higher":[35],"levels":[36],"of":[37,54,76,89,106,111,115],"polynomial":[39],"hierarchy.":[40],"We":[41,56],"identify":[42],"such":[43],"a":[44,52,59,67,81,112,123],"problem,":[45],"called":[46],"Q-ALL":[47,63],"SAT,":[48],"arises":[50],"in":[51],"variety":[53],"applications.":[55],"have":[57],"designed":[58],"solution":[60],"algorithm":[61,118],"employs":[66],"solver":[69],"and":[70],"thus":[71],"exploits":[72],"recent":[74],"advances":[75],"solvers.":[78],"In":[79],"addition,":[80],"heuristic":[82],"applied":[84],"reduce":[86],"number":[88],"solved":[95],"by":[96],"solver.":[99],"A":[100],"learning":[101],"scheme":[102],"improves":[103],"performance":[105],"heuristic.":[108],"Test":[109],"results":[110],"first":[113],"implementation":[114],"proposed":[117],"confirm":[119],"this":[121],"promising":[125],"approach.":[126]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}