{"id":"https://openalex.org/W2189084874","doi":"https://doi.org/10.3233/sat190077","title":"DepQBF: A Dependency-Aware QBF Solver","display_name":"DepQBF: A Dependency-Aware QBF Solver","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2189084874","doi":"https://doi.org/10.3233/sat190077","mag":"2189084874"},"language":"en","primary_location":{"id":"doi:10.3233/sat190077","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190077","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190077?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190077","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190077?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190077","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040670461","display_name":"Florian Lonsing","orcid":"https://orcid.org/0000-0002-5715-7231"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Florian Lonsing","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria. E-mails:\u00a0florian.lonsing@jku.at,\u00a0biere@jku.at"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria. E-mails:\u00a0florian.lonsing@jku.at,\u00a0biere@jku.at","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082596567","display_name":"Armin Biere","orcid":"https://orcid.org/0000-0001-7170-9242"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Armin Biere","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria. E-mails:\u00a0florian.lonsing@jku.at,\u00a0biere@jku.at"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria. E-mails:\u00a0florian.lonsing@jku.at,\u00a0biere@jku.at","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040670461"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":null,"apc_paid":null,"fwci":9.5658,"has_fulltext":true,"cited_by_count":135,"citation_normalized_percentile":{"value":0.98536531,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"7","issue":"2-3","first_page":"71","last_page":"76"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9883999824523926,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.98580002784729,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.725785493850708},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.6494377255439758},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6280924677848816},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.6249945163726807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6233634352684021},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.6150835752487183},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.48837798833847046},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.4805715084075928},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.424032986164093},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3453534245491028},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32671183347702026},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26645606756210327},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16447657346725464}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.725785493850708},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.6494377255439758},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6280924677848816},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.6249945163726807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6233634352684021},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.6150835752487183},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.48837798833847046},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.4805715084075928},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.424032986164093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3453534245491028},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32671183347702026},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26645606756210327},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16447657346725464},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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":1,"locations":[{"id":"doi:10.3233/sat190077","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190077","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190077?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190077","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3233/sat190077","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190077","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190077?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190077","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2189084874.pdf","grobid_xml":"https://content.openalex.org/works/W2189084874.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W32552433","https://openalex.org/W1487809834","https://openalex.org/W1513165874","https://openalex.org/W1518705996","https://openalex.org/W1541238879","https://openalex.org/W1553278548","https://openalex.org/W1571893670","https://openalex.org/W1573666268","https://openalex.org/W1603914046","https://openalex.org/W1608123432","https://openalex.org/W1608173173","https://openalex.org/W1884103822","https://openalex.org/W1916519491","https://openalex.org/W1970908002","https://openalex.org/W1976876676","https://openalex.org/W1986022261","https://openalex.org/W2012165860","https://openalex.org/W2039585983","https://openalex.org/W2075959177","https://openalex.org/W2106603522","https://openalex.org/W2108447646","https://openalex.org/W2142785340","https://openalex.org/W2149441048","https://openalex.org/W4233090747","https://openalex.org/W4233588668","https://openalex.org/W4247585869","https://openalex.org/W4285719527","https://openalex.org/W6629127987","https://openalex.org/W6814292443"],"related_works":["https://openalex.org/W2796388654","https://openalex.org/W2036901448","https://openalex.org/W1656268799","https://openalex.org/W3107131366","https://openalex.org/W2332241156","https://openalex.org/W2014111643","https://openalex.org/W1600869845","https://openalex.org/W2154853422","https://openalex.org/W1568918982","https://openalex.org/W3136261533"],"abstract_inverted_index":{"We":[0],"present":[1],"DepQBF":[2],"0.1,":[3],"a":[4],"new":[5],"search-based":[6],"solver":[7],"for":[8],"quantified":[9],"boolean":[10],"formulae":[11],"(QBF).":[12],"It":[13],"integrates":[14],"compact":[15],"dependency":[16],"graphs":[17],"to":[18],"overcome":[19],"the":[20],"restrictions":[21],"imposed":[22],"by":[23],"linear":[24],"quantifier":[25],"prefixes":[26],"of":[27],"QBFs":[28],"in":[29],"prenex":[30],"conjunctive":[31],"normal":[32],"form":[33],"(PCNF).":[34],"DepQB":[35]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}