{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T21:45:39Z","timestamp":1769636739327,"version":"3.49.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319491295","type":"print"},{"value":"9783319491301","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49130-1_13","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:13:59Z","timestamp":1478268839000},"page":"164-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["On the Application of Answer Set Programming to the Conference Paper Assignment Problem"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Amendola","sequence":"first","affiliation":[]},{"given":"Carmine","family":"Dodaro","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"key":"13_CR1","unstructured":"Goldsmith, J., Sloan, R.H.: The AI conference paper assignment problem. In: Proceedings of thr AAAI Workshop on Preference Handling for Artificial Intelligence, pp. 53\u201357 (2007)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/978-3-540-69052-8_75","volume-title":"New Frontiers in Applied Artificial Intelligence","author":"F Wang","year":"2008","unstructured":"Wang, F., Chen, B., Miao, Z.: A Survey on Reviewer Assignment Problem. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds.) IEA\/AIE 2008. LNCS (LNAI), vol. 5027, pp. 718\u2013727. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-69052-8_75"},{"issue":"1\u20132","key":"13_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D Manlove","year":"2002","unstructured":"Manlove, D., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"13_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"13_CR5","unstructured":"Alviano, M., Dodaro, C., Ricca, F.: A MaxSAT algorithm using cardinality constraints of bounded size. In: IJCAI, pp. 2677\u20132683. AAAI Press (2015)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-24206-9_17","volume-title":"Datalog Reloaded","author":"M Alviano","year":"2011","unstructured":"Alviano, M., Faber, W., Leone, N., Perri, S., Pfeifer, G., Terracina, G.: The disjunctive datalog system DLV. In: Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2.0 2010. LNCS, vol. 6702, pp. 282\u2013301. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-24206-9_17"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.artint.2015.09.008","volume":"231","author":"F Calimeri","year":"2016","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151\u2013181 (2016)","journal-title":"Artif. Intell."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-23264-5_31","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., Schaub, T.: Progress in clasp series 3. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 368\u2013383. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-23264-5_31"},{"issue":"1\u20134","key":"13_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10472-009-9113-1","volume":"53","author":"E Giunchiglia","year":"2008","unstructured":"Giunchiglia, E., Leone, N., Maratea, M.: On the relation among answer set solvers. Ann. Math. Artif. Intell. 53(1\u20134), 169\u2013204 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11562931_6","volume-title":"Logic Programming","author":"E Giunchiglia","year":"2005","unstructured":"Giunchiglia, E., Maratea, M.: On the relation between answer set and SAT procedures (or, Between cmodels and smodels). In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 37\u201351. Springer, Heidelberg (2005). doi:10.1007\/11562931_6"},{"issue":"6","key":"13_CR11","first-page":"841","volume":"14","author":"M Maratea","year":"2014","unstructured":"Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. TPLP 14(6), 841\u2013868 (2014)","journal-title":"TPLP"},{"issue":"1\u20133","key":"13_CR12","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jalgor.2008.02.006","volume":"63","author":"M Maratea","year":"2008","unstructured":"Maratea, M., Ricca, F., Faber, W., Leone, N.: Look-back techniques and heuristics in DLV: implementation, evaluation, and comparison to QBF solvers. J. Algorithms 63(1\u20133), 70\u201389 (2008)","journal-title":"J. Algorithms"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/3-540-45402-0_39","volume-title":"Logic Programming and Nonmotonic Reasoning","author":"M Balduccini","year":"2001","unstructured":"Balduccini, M., Gelfond, M., Watson, R., Nogueira, M.: The USA-advisor: a case study in answer set planning. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 439\u2013442. Springer, Heidelberg (2001). doi:10.1007\/3-540-45402-0_39"},{"issue":"4\u20135","key":"13_CR14","first-page":"434","volume":"15","author":"SA Gaggl","year":"2015","unstructured":"Gaggl, S.A., Manthey, N., Ronca, A., Wallner, J.P., Woltran, S.: Improved answer-set programming encodings for abstract argumentation. TPLP 15(4\u20135), 434\u2013448 (2015)","journal-title":"TPLP"},{"issue":"5","key":"13_CR15","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1080\/0952813X.2014.993503","volume":"27","author":"F Campeotto","year":"2015","unstructured":"Campeotto, F., Dovier, A., Pontelli, E.: A declarative concurrent system for protein structure prediction on GPU. J. Exp. Theor. Artif. Intell. 27(5), 503\u2013541 (2015)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"1","key":"13_CR16","first-page":"35","volume":"15","author":"E Erdem","year":"2015","unstructured":"Erdem, E., \u00d6ztok, U.: Generating explanations for biomedical queries. TPLP 15(1), 35\u201378 (2015)","journal-title":"TPLP"},{"issue":"4","key":"13_CR17","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1504\/IJDMB.2009.029205","volume":"3","author":"V Fionda","year":"2009","unstructured":"Fionda, V., Palopoli, L., Panni, S., Rombo, S.E.: A technique to search for functional similarities in protein-protein interaction networks. IJDMB 3(4), 431\u2013453 (2009)","journal-title":"IJDMB"},{"issue":"4\u20135","key":"13_CR18","first-page":"696","volume":"15","author":"M Manna","year":"2015","unstructured":"Manna, M., Ricca, F., Terracina, G.: Taming primary key violations to query large inconsistent data via ASP. TPLP 15(4\u20135), 696\u2013710 (2015)","journal-title":"TPLP"},{"issue":"6","key":"13_CR19","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.datak.2010.01.005","volume":"69","author":"MC Marileo","year":"2010","unstructured":"Marileo, M.C., Bertossi, L.E.: The consistency extractor system: Answer set programs for consistent query answering in databases. Data Knowl. Eng. 69(6), 545\u2013572 (2010)","journal-title":"Data Knowl. Eng."},{"key":"13_CR20","unstructured":"Amendola, G., Greco, G., Leone, N., Veltri, P.: Modeling and reasoning about NTU games via answer set programming. In: IJCAI, pp. 38\u201345. IJCAI\/AAAI Press (2016)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-20832-4_27","volume-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","author":"G Grasso","year":"2011","unstructured":"Grasso, G., Leone, N., Manna, M., Ricca, F.: ASP at work: spin-off and applications of the DLV system. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS (LNAI), vol. 6565, pp. 432\u2013451. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20832-4_27"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Dodaro, C., Gasteiger, P., Leone, N., Musitsch, B., Ricca, F., Shchekotykhin, K.: Combining answer set programming and domain heuristics for solving hard industrial problems. TPLP 16(5-6) (2016, to appear)","DOI":"10.1017\/S1471068416000284"},{"key":"13_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"issue":"4\u20135","key":"13_CR24","first-page":"559","volume":"15","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Faber, W., Gebser, M.: Rewriting recursive aggregates in answer set programming: back to monotonicity. TPLP 15(4\u20135), 559\u2013573 (2015)","journal-title":"TPLP"},{"issue":"5","key":"13_CR25","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/69.877512","volume":"12","author":"F Buccafurri","year":"2000","unstructured":"Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845\u2013860 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"13_CR26","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W Faber","year":"2011","unstructured":"Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278\u2013298 (2011)","journal-title":"Artif. Intell."},{"issue":"3\/4","key":"13_CR27","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"New Gener. Comput."},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.artint.2016.01.011","volume":"234","author":"G Amendola","year":"2016","unstructured":"Amendola, G., Eiter, T., Fink, M., Leone, N., Moura, J.: Semi-equilibrium models for paracoherent answer set programs. Artif. Intell. 234, 219\u2013271 (2016)","journal-title":"Artif. Intell."},{"issue":"3","key":"13_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-23264-5_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 40\u201354. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-23264-5_5"},{"issue":"2","key":"13_CR31","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295\u2013328 (2001)","journal-title":"J. Econ. Theory"},{"issue":"4","key":"13_CR32","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.2307\/2938172","volume":"59","author":"G Demange","year":"1991","unstructured":"Demange, G., Alkan, A., Gale, D.: Fair allocation of indivisible goods and money and criteria of justice. Econometrica 59(4), 1023\u20131039 (1991)","journal-title":"Econometrica"},{"issue":"3","key":"13_CR33","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1111\/j.1540-5915.1999.tb00910.x","volume":"30","author":"D Hartvigsen","year":"1999","unstructured":"Hartvigsen, D., Wei, J.C., Czuchlewski, R.: The conference paper-reviewer assignment problem. Decis. Sci. 30(3), 865\u2013876 (1999)","journal-title":"Decis. Sci."},{"issue":"1","key":"13_CR34","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1021\/ie050478h","volume":"45","author":"SL Janak","year":"2006","unstructured":"Janak, S.L., Taylor, M.S., Floudas, C.A., Burka, M., Mountziaris, T.J.: Novel and effective integer optimization approach for the NSF panel-assignment problem: a multiresource and preference-constrained generalized assignment problem. Ind. Eng. Chem. Res. 45(1), 258\u2013265 (2006)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"4","key":"13_CR35","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s003550050160","volume":"16","author":"LG Svensson","year":"1999","unstructured":"Svensson, L.G.: Strategy-proof allocation of indivisible goods. Soc. Choice Welf. 16(4), 557\u2013567 (1999)","journal-title":"Soc. Choice Welf."},{"key":"13_CR36","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.cie.2014.02.014","volume":"72","author":"GS Das","year":"2014","unstructured":"Das, G.S., G\u00f6\u00e7ken, T.: A fuzzy approach for the reviewer assignment problem. Comput. Ind. Eng. 72, 50\u201357 (2014)","journal-title":"Comput. Ind. Eng."},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Conry, D., Koren, Y., Ramakrishnan, N.: Recommender systems for the conference paper assignment problem. In: RecSys, pp. 357\u2013360. ACM (2009)","DOI":"10.1145\/1639714.1639787"},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Mimno, D.M., McCallum, A.: Expertise modeling for matching papers with reviewers. In: ACM SIGKDD, pp. 500\u2013509. ACM (2007)","DOI":"10.1145\/1281192.1281247"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Li, X., Watanabe, T.: Automatic Paper-to-reviewer Assignment, based on the Matching Degree of the Reviewers. In: KES, vol. 22. Procedia Computer Science, pp. 633\u2013642. Elsevier (2013)","DOI":"10.1016\/j.procs.2013.09.144"},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Long, C., Wong, R.C., Peng, Y., Ye, L.: On good and fair paper-reviewer assignment. In: ICDM, pp. 1145\u20131150. IEEE Computer Society (2013)","DOI":"10.1109\/ICDM.2013.13"},{"issue":"5","key":"13_CR41","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1016\/j.cor.2012.08.005","volume":"40","author":"F Wang","year":"2013","unstructured":"Wang, F., Zhou, S., Shi, N.: Group-to-group reviewer assignment problem. Comput. OR 40(5), 1351\u20131362 (2013)","journal-title":"Comput. OR"},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-33203-6_28","volume-title":"Web Reasoning and Rule Systems","author":"A Ryabokon","year":"2012","unstructured":"Ryabokon, A., Polleres, A., Friedrich, G., Falkner, A.A., Haselb\u00f6ck, A., Schreiner, H.: (Re)Configuration using web data: a case study on the reviewer assignment problem. In: Kr\u00f6tzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 258\u2013261. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-33203-6_28"},{"key":"13_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2012.12.002","volume":"196","author":"V Fionda","year":"2013","unstructured":"Fionda, V., Greco, G.: The complexity of mixed multi-unit combinatorial auctions: tractability under structural and qualitative restrictions. Artif. Intell. 196, 1\u201325 (2013)","journal-title":"Artif. Intell."},{"key":"13_CR44","doi-asserted-by":"crossref","unstructured":"Fionda, V., Pirr\u00f2, G.: Querying graphs with preferences. In: CIKM, pp. 929\u2013938. ACM (2013)","DOI":"10.1145\/2505515.2505758"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2016 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49130-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:54:14Z","timestamp":1710266054000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49130-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319491295","9783319491301"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49130-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI*IA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Genova","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"XV","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.aixia2016.unige.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}