Query-guided maximum satisfiability Article Swipe
Xin Zhang
,
Ravi Mangal
,
Aditya V. Nori
,
Mayur Naik
·
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.1145/2914770.2837658
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.1145/2914770.2837658
We propose a new optimization problem "Q-MaxSAT", an extension of the well-known Maximum Satisfiability or MaxSAT problem. In contrast to MaxSAT, which aims to find an assignment to all variables in the formula, Q-MaxSAT computes an assignment to a desired subset of variables (or queries) in the formula. Indeed, many problems in diverse domains such as program reasoning, information retrieval, and mathematical optimization can be naturally encoded as Q-MaxSAT instances. We describe an iterative algorithm for solving Q-MaxSAT. In each iteration, the algorithm solves a subproblem that is relevant to the queries, and applies a novel technique to check whether the partial assignment found is a solution to the Q-MaxSAT problem. If the check fails, the algorithm grows the subproblem with a new set of clauses identified as relevant to the queries. Our empirical evaluation shows that our Q-MaxSAT solver Pilot achieves significant improvements in runtime and memory consumption over conventional MaxSAT solvers on several Q-MaxSAT instances generated from real-world problems in program analysis and information retrieval.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1145/2914770.2837658
- http://dl.acm.org/ft_gateway.cfm?id=2837658&type=pdf
- OA Status
- bronze
- References
- 54
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4254942075
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4254942075Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1145/2914770.2837658Digital Object Identifier
- Title
-
Query-guided maximum satisfiabilityWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2016Year of publication
- Publication date
-
2016-01-11Full publication date if available
- Authors
-
Xin Zhang, Ravi Mangal, Aditya V. Nori, Mayur NaikList of authors in order
- Landing page
-
https://doi.org/10.1145/2914770.2837658Publisher landing page
- PDF URL
-
https://dl.acm.org/ft_gateway.cfm?id=2837658&type=pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
bronzeOpen access status per OpenAlex
- OA URL
-
https://dl.acm.org/ft_gateway.cfm?id=2837658&type=pdfDirect OA link when available
- Concepts
-
Maximum satisfiability problem, Satisfiability, Computer science, Boolean satisfiability problem, Solver, Algorithm, Conjunctive normal form, Theoretical computer science, Mathematics, Programming language, Boolean functionTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
54Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4254942075 |
|---|---|
| doi | https://doi.org/10.1145/2914770.2837658 |
| ids.doi | https://doi.org/10.1145/2914770.2837658 |
| ids.openalex | https://openalex.org/W4254942075 |
| fwci | 0.0 |
| type | article |
| title | Query-guided maximum satisfiability |
| awards[0].id | https://openalex.org/G5124456847 |
| awards[0].funder_id | https://openalex.org/F4320332180 |
| awards[0].display_name | |
| awards[0].funder_award_id | #FA8750-15-2-0009 |
| awards[0].funder_display_name | Defense Advanced Research Projects Agency |
| awards[1].id | https://openalex.org/G6151041591 |
| awards[1].funder_id | https://openalex.org/F4320306076 |
| awards[1].display_name | |
| awards[1].funder_award_id | #1253867, #1526270 |
| awards[1].funder_display_name | National Science Foundation |
| biblio.issue | 1 |
| biblio.volume | 51 |
| biblio.last_page | 122 |
| biblio.first_page | 109 |
| topics[0].id | https://openalex.org/T10142 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9968000054359436 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1703 |
| topics[0].subfield.display_name | Computational Theory and Mathematics |
| topics[0].display_name | Formal Methods in Verification |
| topics[1].id | https://openalex.org/T10126 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.996399998664856 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Logic, programming, and type systems |
| topics[2].id | https://openalex.org/T10260 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9952999949455261 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1710 |
| topics[2].subfield.display_name | Information Systems |
| topics[2].display_name | Software Engineering Research |
| funders[0].id | https://openalex.org/F4320306076 |
| funders[0].ror | https://ror.org/021nxhr62 |
| funders[0].display_name | National Science Foundation |
| funders[1].id | https://openalex.org/F4320332180 |
| funders[1].ror | https://ror.org/02caytj08 |
| funders[1].display_name | Defense Advanced Research Projects Agency |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C111797529 |
| concepts[0].level | 3 |
| concepts[0].score | 0.9739739894866943 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q17080584 |
| concepts[0].display_name | Maximum satisfiability problem |
| concepts[1].id | https://openalex.org/C168773769 |
| concepts[1].level | 2 |
| concepts[1].score | 0.7236650586128235 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1350299 |
| concepts[1].display_name | Satisfiability |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6254995465278625 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C6943359 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5762042999267578 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q875276 |
| concepts[3].display_name | Boolean satisfiability problem |
| concepts[4].id | https://openalex.org/C2778770139 |
| concepts[4].level | 2 |
| concepts[4].score | 0.567385196685791 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q1966904 |
| concepts[4].display_name | Solver |
| concepts[5].id | https://openalex.org/C11413529 |
| concepts[5].level | 1 |
| concepts[5].score | 0.50786954164505 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[5].display_name | Algorithm |
| concepts[6].id | https://openalex.org/C16221470 |
| concepts[6].level | 2 |
| concepts[6].score | 0.461132675409317 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q846564 |
| concepts[6].display_name | Conjunctive normal form |
| concepts[7].id | https://openalex.org/C80444323 |
| concepts[7].level | 1 |
| concepts[7].score | 0.33530497550964355 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[7].display_name | Theoretical computer science |
| concepts[8].id | https://openalex.org/C33923547 |
| concepts[8].level | 0 |
| concepts[8].score | 0.32182395458221436 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[8].display_name | Mathematics |
| concepts[9].id | https://openalex.org/C199360897 |
| concepts[9].level | 1 |
| concepts[9].score | 0.06820476055145264 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[9].display_name | Programming language |
| concepts[10].id | https://openalex.org/C187455244 |
| concepts[10].level | 2 |
| concepts[10].score | 0.06477382779121399 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q942353 |
| concepts[10].display_name | Boolean function |
| keywords[0].id | https://openalex.org/keywords/maximum-satisfiability-problem |
| keywords[0].score | 0.9739739894866943 |
| keywords[0].display_name | Maximum satisfiability problem |
| keywords[1].id | https://openalex.org/keywords/satisfiability |
| keywords[1].score | 0.7236650586128235 |
| keywords[1].display_name | Satisfiability |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.6254995465278625 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/boolean-satisfiability-problem |
| keywords[3].score | 0.5762042999267578 |
| keywords[3].display_name | Boolean satisfiability problem |
| keywords[4].id | https://openalex.org/keywords/solver |
| keywords[4].score | 0.567385196685791 |
| keywords[4].display_name | Solver |
| keywords[5].id | https://openalex.org/keywords/algorithm |
| keywords[5].score | 0.50786954164505 |
| keywords[5].display_name | Algorithm |
| keywords[6].id | https://openalex.org/keywords/conjunctive-normal-form |
| keywords[6].score | 0.461132675409317 |
| keywords[6].display_name | Conjunctive normal form |
| keywords[7].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[7].score | 0.33530497550964355 |
| keywords[7].display_name | Theoretical computer science |
| keywords[8].id | https://openalex.org/keywords/mathematics |
| keywords[8].score | 0.32182395458221436 |
| keywords[8].display_name | Mathematics |
| keywords[9].id | https://openalex.org/keywords/programming-language |
| keywords[9].score | 0.06820476055145264 |
| keywords[9].display_name | Programming language |
| keywords[10].id | https://openalex.org/keywords/boolean-function |
| keywords[10].score | 0.06477382779121399 |
| keywords[10].display_name | Boolean function |
| language | en |
| locations[0].id | doi:10.1145/2914770.2837658 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S148324379 |
| locations[0].source.issn | 0362-1340, 1558-1160 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 0362-1340 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | ACM SIGPLAN Notices |
| locations[0].source.host_organization | https://openalex.org/P4310319798 |
| locations[0].source.host_organization_name | Association for Computing Machinery |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319798 |
| locations[0].source.host_organization_lineage_names | Association for Computing Machinery |
| locations[0].license | |
| locations[0].pdf_url | http://dl.acm.org/ft_gateway.cfm?id=2837658&type=pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | ACM SIGPLAN Notices |
| locations[0].landing_page_url | https://doi.org/10.1145/2914770.2837658 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5100327395 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-0036-5996 |
| authorships[0].author.display_name | Xin Zhang |
| authorships[0].countries | US |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I130701444 |
| authorships[0].affiliations[0].raw_affiliation_string | Georgia Institute of Technology, USA |
| authorships[0].institutions[0].id | https://openalex.org/I130701444 |
| authorships[0].institutions[0].ror | https://ror.org/01zkghx44 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I130701444 |
| authorships[0].institutions[0].country_code | US |
| authorships[0].institutions[0].display_name | Georgia Institute of Technology |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Xin Zhang |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Georgia Institute of Technology, USA |
| authorships[1].author.id | https://openalex.org/A5002052018 |
| authorships[1].author.orcid | https://orcid.org/0000-0001-6267-6995 |
| authorships[1].author.display_name | Ravi Mangal |
| authorships[1].countries | US |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I130701444 |
| authorships[1].affiliations[0].raw_affiliation_string | Georgia Institute of Technology, USA |
| authorships[1].institutions[0].id | https://openalex.org/I130701444 |
| authorships[1].institutions[0].ror | https://ror.org/01zkghx44 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I130701444 |
| authorships[1].institutions[0].country_code | US |
| authorships[1].institutions[0].display_name | Georgia Institute of Technology |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Ravi Mangal |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Georgia Institute of Technology, USA |
| authorships[2].author.id | https://openalex.org/A5111937381 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Aditya V. Nori |
| authorships[2].countries | GB |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I4210164937 |
| authorships[2].affiliations[0].raw_affiliation_string | Microsoft Research, UK |
| authorships[2].institutions[0].id | https://openalex.org/I4210164937 |
| authorships[2].institutions[0].ror | https://ror.org/05k87vq12 |
| authorships[2].institutions[0].type | company |
| authorships[2].institutions[0].lineage | https://openalex.org/I1290206253, https://openalex.org/I4210164937 |
| authorships[2].institutions[0].country_code | GB |
| authorships[2].institutions[0].display_name | Microsoft Research (United Kingdom) |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Aditya V. Nori |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Microsoft Research, UK |
| authorships[3].author.id | https://openalex.org/A5075879790 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-1348-8618 |
| authorships[3].author.display_name | Mayur Naik |
| authorships[3].countries | US |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I130701444 |
| authorships[3].affiliations[0].raw_affiliation_string | Georgia Institute of Technology, USA |
| authorships[3].institutions[0].id | https://openalex.org/I130701444 |
| authorships[3].institutions[0].ror | https://ror.org/01zkghx44 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I130701444 |
| authorships[3].institutions[0].country_code | US |
| authorships[3].institutions[0].display_name | Georgia Institute of Technology |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Mayur Naik |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Georgia Institute of Technology, USA |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://dl.acm.org/ft_gateway.cfm?id=2837658&type=pdf |
| open_access.oa_status | bronze |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Query-guided maximum satisfiability |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10142 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9968000054359436 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1703 |
| primary_topic.subfield.display_name | Computational Theory and Mathematics |
| primary_topic.display_name | Formal Methods in Verification |
| related_works | https://openalex.org/W2301405299, https://openalex.org/W2394616262, https://openalex.org/W2480084299, https://openalex.org/W3152212242, https://openalex.org/W3107131366, https://openalex.org/W2014111643, https://openalex.org/W2408080066, https://openalex.org/W2406837904, https://openalex.org/W2571882453, https://openalex.org/W4211028879 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1145/2914770.2837658 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S148324379 |
| best_oa_location.source.issn | 0362-1340, 1558-1160 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 0362-1340 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | ACM SIGPLAN Notices |
| best_oa_location.source.host_organization | https://openalex.org/P4310319798 |
| best_oa_location.source.host_organization_name | Association for Computing Machinery |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319798 |
| best_oa_location.source.host_organization_lineage_names | Association for Computing Machinery |
| best_oa_location.license | |
| best_oa_location.pdf_url | http://dl.acm.org/ft_gateway.cfm?id=2837658&type=pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | ACM SIGPLAN Notices |
| best_oa_location.landing_page_url | https://doi.org/10.1145/2914770.2837658 |
| primary_location.id | doi:10.1145/2914770.2837658 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S148324379 |
| primary_location.source.issn | 0362-1340, 1558-1160 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 0362-1340 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | ACM SIGPLAN Notices |
| primary_location.source.host_organization | https://openalex.org/P4310319798 |
| primary_location.source.host_organization_name | Association for Computing Machinery |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319798 |
| primary_location.source.host_organization_lineage_names | Association for Computing Machinery |
| primary_location.license | |
| primary_location.pdf_url | http://dl.acm.org/ft_gateway.cfm?id=2837658&type=pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | ACM SIGPLAN Notices |
| primary_location.landing_page_url | https://doi.org/10.1145/2914770.2837658 |
| publication_date | 2016-01-11 |
| publication_year | 2016 |
| referenced_works | https://openalex.org/W2071319337, https://openalex.org/W6713809205, https://openalex.org/W2082000355, https://openalex.org/W2164456230, https://openalex.org/W2253971087, https://openalex.org/W2166091242, https://openalex.org/W2127574686, https://openalex.org/W2036265926, https://openalex.org/W1585529040, https://openalex.org/W1868868480, https://openalex.org/W6636526798, https://openalex.org/W1586099086, https://openalex.org/W193459320, https://openalex.org/W4247632680, https://openalex.org/W6713688368, https://openalex.org/W6694557836, https://openalex.org/W1883733964, https://openalex.org/W4240558819, https://openalex.org/W2145001295, https://openalex.org/W121830907, https://openalex.org/W6603669155, https://openalex.org/W2017112612, https://openalex.org/W1496468608, https://openalex.org/W2157056800, https://openalex.org/W4235421007, https://openalex.org/W2079877139, https://openalex.org/W2284951589, https://openalex.org/W2098984274, https://openalex.org/W6687767793, https://openalex.org/W6785456720, https://openalex.org/W87126228, https://openalex.org/W2029958553, https://openalex.org/W134459671, https://openalex.org/W4300810260, https://openalex.org/W37002918, https://openalex.org/W2135209143, https://openalex.org/W1907086563, https://openalex.org/W6990023262, https://openalex.org/W1977970897, https://openalex.org/W1538211826, https://openalex.org/W4243644740, https://openalex.org/W2110833886, https://openalex.org/W2107356010, https://openalex.org/W2123757087, https://openalex.org/W6844382842, https://openalex.org/W2052059088, https://openalex.org/W2998050925, https://openalex.org/W2024113144, https://openalex.org/W2050680750, https://openalex.org/W2278445211, https://openalex.org/W1508638970, https://openalex.org/W156009831, https://openalex.org/W4300076045, https://openalex.org/W3045954188 |
| referenced_works_count | 54 |
| abstract_inverted_index.a | 2, 38, 84, 94, 105, 121 |
| abstract_inverted_index.If | 111 |
| abstract_inverted_index.In | 17, 78 |
| abstract_inverted_index.We | 0, 70 |
| abstract_inverted_index.an | 7, 25, 35, 72 |
| abstract_inverted_index.as | 55, 67, 127 |
| abstract_inverted_index.be | 64 |
| abstract_inverted_index.in | 30, 45, 51, 144, 161 |
| abstract_inverted_index.is | 87, 104 |
| abstract_inverted_index.of | 9, 41, 124 |
| abstract_inverted_index.on | 153 |
| abstract_inverted_index.or | 14 |
| abstract_inverted_index.to | 19, 23, 27, 37, 89, 97, 107, 129 |
| abstract_inverted_index.(or | 43 |
| abstract_inverted_index.Our | 132 |
| abstract_inverted_index.all | 28 |
| abstract_inverted_index.and | 60, 92, 146, 164 |
| abstract_inverted_index.can | 63 |
| abstract_inverted_index.for | 75 |
| abstract_inverted_index.new | 3, 122 |
| abstract_inverted_index.our | 137 |
| abstract_inverted_index.set | 123 |
| abstract_inverted_index.the | 10, 31, 46, 81, 90, 100, 108, 112, 115, 118, 130 |
| abstract_inverted_index.aims | 22 |
| abstract_inverted_index.each | 79 |
| abstract_inverted_index.find | 24 |
| abstract_inverted_index.from | 158 |
| abstract_inverted_index.many | 49 |
| abstract_inverted_index.over | 149 |
| abstract_inverted_index.such | 54 |
| abstract_inverted_index.that | 86, 136 |
| abstract_inverted_index.with | 120 |
| abstract_inverted_index.Pilot | 140 |
| abstract_inverted_index.check | 98, 113 |
| abstract_inverted_index.found | 103 |
| abstract_inverted_index.grows | 117 |
| abstract_inverted_index.novel | 95 |
| abstract_inverted_index.shows | 135 |
| abstract_inverted_index.which | 21 |
| abstract_inverted_index.MaxSAT | 15, 151 |
| abstract_inverted_index.fails, | 114 |
| abstract_inverted_index.memory | 147 |
| abstract_inverted_index.solver | 139 |
| abstract_inverted_index.solves | 83 |
| abstract_inverted_index.subset | 40 |
| abstract_inverted_index.Indeed, | 48 |
| abstract_inverted_index.MaxSAT, | 20 |
| abstract_inverted_index.Maximum | 12 |
| abstract_inverted_index.applies | 93 |
| abstract_inverted_index.clauses | 125 |
| abstract_inverted_index.desired | 39 |
| abstract_inverted_index.diverse | 52 |
| abstract_inverted_index.domains | 53 |
| abstract_inverted_index.encoded | 66 |
| abstract_inverted_index.partial | 101 |
| abstract_inverted_index.problem | 5 |
| abstract_inverted_index.program | 56, 162 |
| abstract_inverted_index.propose | 1 |
| abstract_inverted_index.runtime | 145 |
| abstract_inverted_index.several | 154 |
| abstract_inverted_index.solvers | 152 |
| abstract_inverted_index.solving | 76 |
| abstract_inverted_index.whether | 99 |
| abstract_inverted_index.Q-MaxSAT | 33, 68, 109, 138, 155 |
| abstract_inverted_index.achieves | 141 |
| abstract_inverted_index.analysis | 163 |
| abstract_inverted_index.computes | 34 |
| abstract_inverted_index.contrast | 18 |
| abstract_inverted_index.describe | 71 |
| abstract_inverted_index.formula, | 32 |
| abstract_inverted_index.formula. | 47 |
| abstract_inverted_index.problem. | 16, 110 |
| abstract_inverted_index.problems | 50, 160 |
| abstract_inverted_index.queries) | 44 |
| abstract_inverted_index.queries, | 91 |
| abstract_inverted_index.queries. | 131 |
| abstract_inverted_index.relevant | 88, 128 |
| abstract_inverted_index.solution | 106 |
| abstract_inverted_index.Q-MaxSAT. | 77 |
| abstract_inverted_index.algorithm | 74, 82, 116 |
| abstract_inverted_index.empirical | 133 |
| abstract_inverted_index.extension | 8 |
| abstract_inverted_index.generated | 157 |
| abstract_inverted_index.instances | 156 |
| abstract_inverted_index.iterative | 73 |
| abstract_inverted_index.naturally | 65 |
| abstract_inverted_index.technique | 96 |
| abstract_inverted_index.variables | 29, 42 |
| abstract_inverted_index.assignment | 26, 36, 102 |
| abstract_inverted_index.evaluation | 134 |
| abstract_inverted_index.identified | 126 |
| abstract_inverted_index.instances. | 69 |
| abstract_inverted_index.iteration, | 80 |
| abstract_inverted_index.real-world | 159 |
| abstract_inverted_index.reasoning, | 57 |
| abstract_inverted_index.retrieval, | 59 |
| abstract_inverted_index.retrieval. | 166 |
| abstract_inverted_index.subproblem | 85, 119 |
| abstract_inverted_index.well-known | 11 |
| abstract_inverted_index."Q-MaxSAT", | 6 |
| abstract_inverted_index.consumption | 148 |
| abstract_inverted_index.information | 58, 165 |
| abstract_inverted_index.significant | 142 |
| abstract_inverted_index.conventional | 150 |
| abstract_inverted_index.improvements | 143 |
| abstract_inverted_index.mathematical | 61 |
| abstract_inverted_index.optimization | 4, 62 |
| abstract_inverted_index.Satisfiability | 13 |
| cited_by_percentile_year | |
| countries_distinct_count | 2 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.24009466 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |