nach oben

Erschienen in:

2016 | OriginalPaper | Buchkapitel

On the Application of Answer Set Programming to the Conference Paper Assignment Problem

verfasst von : Giovanni Amendola, Carmine Dodaro, Nicola Leone, Francesco Ricca

Erschienen in: AI*IA 2016 Advances in Artificial Intelligence

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Among the tasks to be carried out by conference organizers is the one of assigning reviewers to papers. That problem is known in the literature as the Conference Paper Assignment Problem (CPAP). In this paper we approach the solution of a reasonably rich variant of the CPAP by means of Answer Set Programming (ASP). ASP is an established logic-based programming paradigm which has been successfully applied for solving complex problems arising in Artificial Intelligence. We show how the CPAP can be elegantly encoded by means of an ASP program, and we analyze the results of an experiment, conducted on real-world data, that outlines the viability of our solution.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Answer Set Enumeration via Assumption Literals

Nächstes Kapitel A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form

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–57 (2007)

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–727. Springer, Heidelberg (2008). doi:10.1007/978-3-540-69052-8_75 CrossRef

Manlove, D., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1–2), 261–279 (2002)MathSciNetCrossRefMATH

Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)CrossRef

Alviano, M., Dodaro, C., Ricca, F.: A MaxSAT algorithm using cardinality constraints of bounded size. In: IJCAI, pp. 2677–2683. AAAI Press (2015)

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–301. Springer, Heidelberg (2011). doi:10.1007/978-3-642-24206-9_17 CrossRef

Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151–181 (2016)MathSciNetCrossRefMATH

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–383. Springer, Heidelberg (2015). doi:10.1007/978-3-319-23264-5_31 CrossRef

Giunchiglia, E., Leone, N., Maratea, M.: On the relation among answer set solvers. Ann. Math. Artif. Intell. 53(1–4), 169–204 (2008)MathSciNetCrossRefMATH

10.

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–51. Springer, Heidelberg (2005). doi:10.1007/11562931_6 CrossRef

11.

Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. TPLP 14(6), 841–868 (2014)MathSciNet

12.

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–3), 70–89 (2008)MathSciNetCrossRefMATH

13.

Balduccini, M., Gelfond, M., Watson, R., Nogueira, M.: The USA-advisor: a case study in answer set planning. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 439–442. Springer, Heidelberg (2001). doi:10.1007/3-540-45402-0_39 CrossRef

14.

Gaggl, S.A., Manthey, N., Ronca, A., Wallner, J.P., Woltran, S.: Improved answer-set programming encodings for abstract argumentation. TPLP 15(4–5), 434–448 (2015)MathSciNet

15.

Campeotto, F., Dovier, A., Pontelli, E.: A declarative concurrent system for protein structure prediction on GPU. J. Exp. Theor. Artif. Intell. 27(5), 503–541 (2015)CrossRef

16.

Erdem, E., Öztok, U.: Generating explanations for biomedical queries. TPLP 15(1), 35–78 (2015)MathSciNet

17.

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–453 (2009)CrossRef

18.

Manna, M., Ricca, F., Terracina, G.: Taming primary key violations to query large inconsistent data via ASP. TPLP 15(4–5), 696–710 (2015)MathSciNet

19.

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–572 (2010)CrossRef

20.

Amendola, G., Greco, G., Leone, N., Veltri, P.: Modeling and reasoning about NTU games via answer set programming. In: IJCAI, pp. 38–45. IJCAI/AAAI Press (2016)

21.

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–451. Springer, Heidelberg (2011). doi:10.1007/978-3-642-20832-4_27 CrossRef

22.

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)

23.

Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)CrossRefMATH

24.

Alviano, M., Faber, W., Gebser, M.: Rewriting recursive aggregates in answer set programming: back to monotonicity. TPLP 15(4–5), 559–573 (2015)MathSciNet

25.

Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845–860 (2000)CrossRef

26.

Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278–298 (2011)MathSciNetCrossRefMATH

27.

Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)CrossRefMATH

28.

Amendola, G., Eiter, T., Fink, M., Leone, N., Moura, J.: Semi-equilibrium models for paracoherent answer set programs. Artif. Intell. 234, 219–271 (2016)MathSciNetCrossRefMATH

29.

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–562 (2006)MathSciNetCrossRef

30.

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–54. Springer, Heidelberg (2015). doi:10.1007/978-3-319-23264-5_5 CrossRef

31.

Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295–328 (2001)MathSciNetCrossRefMATH

32.

Demange, G., Alkan, A., Gale, D.: Fair allocation of indivisible goods and money and criteria of justice. Econometrica 59(4), 1023–1039 (1991)MathSciNetCrossRefMATH

33.

Hartvigsen, D., Wei, J.C., Czuchlewski, R.: The conference paper-reviewer assignment problem. Decis. Sci. 30(3), 865–876 (1999)CrossRef

34.

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–265 (2006)CrossRef

35.

Svensson, L.G.: Strategy-proof allocation of indivisible goods. Soc. Choice Welf. 16(4), 557–567 (1999)MathSciNetCrossRefMATH

36.

Das, G.S., Göçken, T.: A fuzzy approach for the reviewer assignment problem. Comput. Ind. Eng. 72, 50–57 (2014)CrossRef

37.

Conry, D., Koren, Y., Ramakrishnan, N.: Recommender systems for the conference paper assignment problem. In: RecSys, pp. 357–360. ACM (2009)

38.

Mimno, D.M., McCallum, A.: Expertise modeling for matching papers with reviewers. In: ACM SIGKDD, pp. 500–509. ACM (2007)

39.

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–642. Elsevier (2013)

40.

Long, C., Wong, R.C., Peng, Y., Ye, L.: On good and fair paper-reviewer assignment. In: ICDM, pp. 1145–1150. IEEE Computer Society (2013)

41.

Wang, F., Zhou, S., Shi, N.: Group-to-group reviewer assignment problem. Comput. OR 40(5), 1351–1362 (2013)MathSciNetCrossRef

42.

Ryabokon, A., Polleres, A., Friedrich, G., Falkner, A.A., Haselböck, A., Schreiner, H.: (Re)Configuration using web data: a case study on the reviewer assignment problem. In: Krötzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 258–261. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33203-6_28 CrossRef

43.

Fionda, V., Greco, G.: The complexity of mixed multi-unit combinatorial auctions: tractability under structural and qualitative restrictions. Artif. Intell. 196, 1–25 (2013)MathSciNetCrossRefMATH

44.

Fionda, V., Pirrò, G.: Querying graphs with preferences. In: CIKM, pp. 929–938. ACM (2013)

Titel: On the Application of Answer Set Programming to the Conference Paper Assignment Problem
verfasst von: Giovanni Amendola
Carmine Dodaro
Nicola Leone
Francesco Ricca
Verlag: Springer International Publishing
Buch: AI*IA 2016 Advances in Artificial Intelligence
Print ISBN: 978-3-319-49129-5

Electronic ISBN: 978-3-319-49130-1

Copyright-Jahr: 2016
DOI: https://doi.org/10.1007/978-3-319-49130-1_13

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"