{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T14:28:20Z","timestamp":1787063300508,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2568225.2568306","type":"proceedings-article","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T09:48:00Z","timestamp":1400579280000},"page":"745-755","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Towards efficient optimization in package management systems"],"prefix":"10.1145","author":[{"given":"Alexey","family":"Ignatiev","sequence":"first","affiliation":[{"name":"INESC-ID, Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikol\u00e1\u0161","family":"Janota","sequence":"additional","affiliation":[{"name":"INESC-ID, Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[{"name":"University College Dublin, Ireland \/ INESC-ID, Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"20","volume-title":"Proceedings of the FRCSS \u201906 workshop, ser. EASST Newsletter","volume":"12","author":"Di Cosmo R.","year":"2006","unstructured":"R. Di Cosmo , B. Durak , X. Leroy , F. Mancinelli , and J. Vouillon , \u201c Maintaining large software distributions: New challenges from the FOSS era ,\u201d in Proceedings of the FRCSS \u201906 workshop, ser. EASST Newsletter , vol. 12 . Vienna, Autriche : EASST, 2006 , pp. 7\u2013 20 . R. Di Cosmo, B. Durak, X. Leroy, F. Mancinelli, and J. Vouillon, \u201cMaintaining large software distributions: New challenges from the FOSS era,\u201d in Proceedings of the FRCSS \u201906 workshop, ser. EASST Newsletter, vol. 12. Vienna, Autriche: EASST, 2006, pp. 7\u201320."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.59"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2006.49"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1595800.1595805"},{"key":"e_1_3_2_1_5_1","first-page":"25","volume-title":"Eds.","volume":"65","author":"Gebser M.","year":"2011","unstructured":"M. Gebser , R. Kaminski , and T. Schaub , \u201c aspcud: A Linux package configuration tool based on answer set programming,\u201d in LoCoCo, ser. EPTCS, C. Drescher, I. Lynce, and R. Treinen , Eds. , vol. 65 , 2011 , pp. 12\u2013 25 . M. Gebser, R. Kaminski, and T. Schaub, \u201caspcud: A Linux package configuration tool based on answer set programming,\u201d in LoCoCo, ser. EPTCS, C. Drescher, I. Lynce, and R. Treinen, Eds., vol. 65, 2011, pp. 12\u201325."},{"key":"e_1_3_2_1_6_1","unstructured":"\u201cEclipse project \u201d http:\/\/www.eclipse.org\/.  \u201cEclipse project \u201d http:\/\/www.eclipse.org\/."},{"key":"e_1_3_2_1_7_1","first-page":"94","volume-title":"Int. CMG Conference. Computer Measurement Group","author":"Hoover C.","year":"2006","unstructured":"C. Hoover , \u201c A methodology for determining response time baselines ,\u201d in Int. CMG Conference. Computer Measurement Group , 2006 , pp. 85\u2013 94 . C. Hoover, \u201cA methodology for determining response time baselines,\u201d in Int. CMG Conference. Computer Measurement Group, 2006, pp. 85\u201394."},{"key":"e_1_3_2_1_9_1","unstructured":"E. C. Bailey \u201cMaximum RPM: Taking the Red Hat package manager to the limit \u201d http:\/\/www.rpm.org\/max-rpm.  E. C. Bailey \u201cMaximum RPM: Taking the Red Hat package manager to the limit \u201d http:\/\/www.rpm.org\/max-rpm."},{"key":"e_1_3_2_1_10_1","unstructured":"J. R. O. Aoki \u201cDebian new maintainers\u2019 guide \u201d http: \/\/www.debian.org\/doc\/devel-manuals#maint-guide.  J. R. O. Aoki \u201cDebian new maintainers\u2019 guide \u201d http: \/\/www.debian.org\/doc\/devel-manuals#maint-guide."},{"key":"e_1_3_2_1_12_1","unstructured":"\u201cMancoosi international solver competition \u201d http:\/\/www.mancoosi.org\/misc.  \u201cMancoosi international solver competition \u201d http:\/\/www.mancoosi.org\/misc."},{"key":"e_1_3_2_1_13_1","unstructured":"\u201cMancoosi software \u201d http:\/\/www.mancoosi.org\/software.  \u201cMancoosi software \u201d http:\/\/www.mancoosi.org\/software."},{"key":"e_1_3_2_1_14_1","first-page":"631","volume-title":"Handbook of Satisfiability, ser. Frontiers in Artificial Intelligence and Applications","author":"Li C. M.","year":"2009","unstructured":"C. M. Li and F. Many\u00e0 , \u201c MaxSAT, hard and soft constraints ,\u201d in Handbook of Satisfiability, ser. Frontiers in Artificial Intelligence and Applications , A. Biere, M. Heule, H. van Maaren, and T. Walsh, Eds. IOS Press , 2009 , vol. 185 , pp. 613\u2013 631 . C. M. Li and F. Many\u00e0, \u201cMaxSAT, hard and soft constraints,\u201d in Handbook of Satisfiability, ser. Frontiers in Artificial Intelligence and Applications, A. Biere, M. Heule, H. van Maaren, and T. Walsh, Eds. IOS Press, 2009, vol. 185, pp. 613\u2013631."},{"issue":"1","key":"e_1_3_2_1_15_1","first-page":"89","article-title":"PackUp: Tools for package upgradability solving","volume":"8","author":"Janota M.","year":"2012","unstructured":"M. Janota , I. Lynce , V. M. Manquinho , and J. Marques-Silva , \u201c PackUp: Tools for package upgradability solving ,\u201d JSAT , vol. 8 , no. 1\/2 , pp. 89 \u2013 94 , 2012 . M. Janota, I. Lynce, V. M. Manquinho, and J. Marques-Silva, \u201cPackUp: Tools for package upgradability solving,\u201d JSAT, vol. 8, no. 1\/2, pp. 89\u201394, 2012.","journal-title":"JSAT"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1121732"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9233-2"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859087"},{"key":"e_1_3_2_1_19_1","first-page":"10","volume-title":"Eds.","volume":"11","author":"Gebser M.","year":"2011","unstructured":"M. Gebser , R. Kaminski , B. Kaufmann , and T. Schaub , \u201c Multi-criteria optimization in answer set programming,\u201d in ICLP (Technical Communications), ser. LIPIcs, J. P. Gallagher and M. Gelfond , Eds. , vol. 11 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , 2011 , pp. 1\u2013 10 . M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub, \u201cMulti-criteria optimization in answer set programming,\u201d in ICLP (Technical Communications), ser. LIPIcs, J. P. Gallagher and M. Gelfond, Eds., vol. 11. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011, pp. 1\u201310."},{"key":"e_1_3_2_1_20_1","first-page":"22","volume-title":"Eds.","volume":"29","author":"Argelich J.","year":"2010","unstructured":"J. Argelich , D. Le Berre , I. Lynce , J. Marques-Silva , and P. Rapicault , \u201c Solving linux upgradeability problems using Boolean optimization,\u201d in LoCoCo, ser. EPTCS, I. Lynce and R. Treinen , Eds. , vol. 29 , 2010 , pp. 11\u2013 22 . J. Argelich, D. Le Berre, I. Lynce, J. Marques-Silva, and P. Rapicault, \u201cSolving linux upgradeability problems using Boolean optimization,\u201d in LoCoCo, ser. EPTCS, I. Lynce and R. Treinen, Eds., vol. 29, 2010, pp. 11\u201322."},{"key":"e_1_3_2_1_21_1","series-title":"Lecture Notes in Computer Science","first-page":"144","volume-title":"Canadian Conference on AI","author":"Smyth K.","year":"2003","unstructured":"K. Smyth , H. H. Hoos , and T. St\u00fctzle , \u201c Iterated robust tabu search for MAX-SAT ,\u201d in Canadian Conference on AI , ser. Lecture Notes in Computer Science , Y. Xiang and B. Chaib-draa, Eds., vol. 2671 . Springer , 2003 , pp. 129\u2013 144 . K. Smyth, H. H. Hoos, and T. St\u00fctzle, \u201cIterated robust tabu search for MAX-SAT,\u201d in Canadian Conference on AI, ser. Lecture Notes in Computer Science, Y. Xiang and B. Chaib-draa, Eds., vol. 2671. Springer, 2003, pp. 129\u2013144."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9084-z"},{"key":"e_1_3_2_1_23_1","volume-title":"Ed. IJCAI\/AAAI","author":"Marques-Silva J.","year":"2013","unstructured":"J. Marques-Silva , F. Heras , M. Janota , A. Previti , and A. Belov , \u201c On computing minimal correction subsets,\u201d in IJCAI, F. Rossi , Ed. IJCAI\/AAAI , 2013 . J. Marques-Silva, F. Heras, M. Janota, A. Previti, and A. Belov, \u201cOn computing minimal correction subsets,\u201d in IJCAI, F. Rossi, Ed. IJCAI\/AAAI, 2013."},{"key":"e_1_3_2_1_24_1","unstructured":"\u201cPackage upgradability problem solver \u201d http:\/\/sat.inesc-id.pt\/\u02dcmikolas\/sw\/packup\/.  \u201cPackage upgradability problem solver \u201d http:\/\/sat.inesc-id.pt\/\u02dcmikolas\/sw\/packup\/."},{"key":"e_1_3_2_1_25_1","first-page":"502","article-title":"An Extensible SAT-solver","author":"E\u00e9n N.","year":"2003","unstructured":"N. E\u00e9n and N. S\u00f6rensson , \u201c An Extensible SAT-solver ,\u201d in Theory and Applications of Satisfiability Testing , 2003 , pp. 502 \u2013 518 . N. E\u00e9n and N. S\u00f6rensson, \u201cAn Extensible SAT-solver,\u201d in Theory and Applications of Satisfiability Testing, 2003, pp. 502\u2013518.","journal-title":"Theory and Applications of Satisfiability Testing"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486843"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.10.010"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.65.2"},{"key":"e_1_3_2_1_29_1","volume-title":"Apt \u2013 Debian Wiki","year":"2014","unstructured":"\u201c Apt \u2013 Debian Wiki ,\u201d https:\/\/wiki.debian.org\/Apt, accessed: 2014 -02-27. \u201cApt \u2013 Debian Wiki,\u201d https:\/\/wiki.debian.org\/Apt, accessed: 2014-02-27."},{"key":"e_1_3_2_1_30_1","volume-title":"Portal:Libzypp \u2013 openSUSE","year":"2014","unstructured":"\u201c Portal:Libzypp \u2013 openSUSE ,\u201d http:\/\/en.opensuse.org\/Portal:Libzypp, accessed: 2014 -02-27. \u201cPortal:Libzypp \u2013 openSUSE,\u201d http:\/\/en.opensuse.org\/Portal:Libzypp, accessed: 2014-02-27."}],"event":{"name":"ICSE '14: 36th International Conference on Software Engineering","location":"Hyderabad India","acronym":"ICSE '14","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","TCSE IEEE Computer Society's Tech. Council on Software Engin."]},"container-title":["Proceedings of the 36th International Conference on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2568225.2568306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2568225.2568306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:01:37Z","timestamp":1750215697000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2568225.2568306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":28,"alternative-id":["10.1145\/2568225.2568306","10.1145\/2568225"],"URL":"https:\/\/doi.org\/10.1145\/2568225.2568306","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}