{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:49Z","timestamp":1772164009334,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T00:00:00Z","timestamp":1484092800000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#1253867, #1526270"],"award-info":[{"award-number":["#1253867, #1526270"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["#FA8750-15-2-0009"],"award-info":[{"award-number":["#FA8750-15-2-0009"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837658","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"109-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Query-guided maximum satisfiability"],"prefix":"10.1145","author":[{"given":"Xin","family":"Zhang","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, USA"}]},{"given":"Ravi","family":"Mangal","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}]},{"given":"Aditya V.","family":"Nori","sequence":"additional","affiliation":[{"name":"Microsoft Research, UK"}]},{"given":"Mayur","family":"Naik","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"AI Genealogy Project. http:\/\/aigp.eecs.umich.edu."},{"key":"e_1_3_2_1_2_1","unstructured":"DBLP: computer science bibliography. http:\/\/http:\/\/dblp.uni-trier.de."},{"key":"e_1_3_2_1_3_1","unstructured":"Max-SAT Evaluation. http:\/\/www.maxsat.udl.cat\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.01.002"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management","author":"Aref M.","year":"2015","unstructured":"M. Aref, B. Kimelfeld, E. Pasalic, and N. Vasiloglou. Extending datalog with analytics in LogicBlox. In Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, 2015."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503274"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956759"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832249.2832283"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of International Symposium on Symbolic Computation in Software Science (SCSS)","author":"Bjorner N.","year":"2014","unstructured":"N. Bjorner and A.-D. Phan. \u03bdz: Maximal satisfaction with Z3. In Proceedings of International Symposium on Symbolic Computation in Software Science (SCSS), 2014."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958109"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876643"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793956.1793962"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1296231"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28067-2_3"},{"key":"e_1_3_2_1_17_1","first-page":"152","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"Gu J.","unstructured":"J. Gu, P. W. Purdom, J. Franco, and B. W. Wah. Algorithms for the satisfiability (SAT) problem: A survey. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 19\u2013 152. American Mathematical Society, 1996."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760267.1760284"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1767111.1767128"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7822"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.53994"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-61499-419-0-453"},{"key":"e_1_3_2_1_23_1","volume-title":"MiFuMax \u2014 a literate MaxSAT solver","author":"Janota M.","year":"2013","unstructured":"M. Janota. MiFuMax \u2014 a literate MaxSAT solver, 2013."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032305.2032345"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993550"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30353-1_10"},{"key":"e_1_3_2_1_27_1","volume-title":"The Satisfiability Problem: Theory and Applications","author":"Kautz H.","year":"1996","unstructured":"H. Kautz, B. Selman, and Y. Jiang. A general stochastic approach to solving problems with hard and soft constraints. In The Satisfiability Problem: Theory and Applications, 1996."},{"key":"e_1_3_2_1_28_1","volume-title":"NIPS Workshop on Probabilistic Programming: Foundations and Applications","author":"Kimmig A.","year":"2012","unstructured":"A. Kimmig, S. H. Bach, M. Broecheler, B. Huang, and L. Getoor. A short introduction to probabilistic soft logic. In NIPS Workshop on Probabilistic Programming: Foundations and Applications, 2012."},{"key":"e_1_3_2_1_29_1","volume-title":"Department of Computer Science and Engineering","author":"Kok S.","year":"2007","unstructured":"S. Kok, M. Sumner, M. Richardson, P. Singla, H. Poon, D. Lowd, and P. Domingos. The Alchemy system for statistical relational AI. Technical report, Department of Computer Science and Engineering, University of Washington, Seattle, WA, 2007. http:\/\/alchemy.cs.washington.edu."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2013.6679413"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_52"},{"key":"e_1_3_2_1_32_1","volume-title":"Spark: A flexible points-to analysis framework for Java. Master\u2019s thesis","author":"Lhot\u00e1k O.","year":"2002","unstructured":"O. Lhot\u00e1k. Spark: A flexible points-to analysis framework for Java. Master\u2019s thesis, McGill University, 2002."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535857"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993567"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786851"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24318-4_22"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403474"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2540128.2540218"},{"key":"e_1_3_2_1_39_1","volume-title":"CP","author":"Martins R.","year":"2014","unstructured":"R. Martins, S. Joshi, V. M. Manquinho, and I. Lynce. Incremental cardinality constraints for MaxSAT. In CP, 2014."},{"key":"e_1_3_2_1_40_1","volume-title":"Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications (CODAS)","author":"Miyazaki S.","year":"1996","unstructured":"S. Miyazaki, K. Iwama, and Y. Kambayashi. Database queries as combinatorial optimization problems. In Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications (CODAS), 1996."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-013-9146-2"},{"key":"e_1_3_2_1_42_1","volume-title":"CP","author":"Morgado A.","year":"2014","unstructured":"A. Morgado, C. Dodaro, and J. Marques-Silva. Core-guided MaxSAT with soft cardinality constraints. In CP, 2014."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_3_2_1_44_1","volume-title":"AAAI","author":"Narodytska N.","year":"2014","unstructured":"N. Narodytska and F. Bacchus. Maximum satisfiability using coreguided MaxSAT resolution. In AAAI, 2014."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/1978665.1978669"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/2891460.2891563"},{"key":"e_1_3_2_1_47_1","volume-title":"Computational complexity","author":"Papadimitriou C. H.","year":"1994","unstructured":"C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5833-1"},{"key":"e_1_3_2_1_49_1","volume-title":"UAI","author":"Riedel S.","year":"2008","unstructured":"S. Riedel. Improving the accuracy and efficiency of MAP inference for Markov Logic. In UAI, 2008."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134027"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094817"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0189"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011203002719"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/1965254"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5488-x"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/505388.505432"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2006.11.005"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594327"}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837658","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837658","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:28:03Z","timestamp":1763458083000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":58,"alternative-id":["10.1145\/2837614.2837658","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837658","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837658","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}