Matchmaking with answer set programming

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Matchmaking is a form of scheduling that aims at bringing companies or people together that share common interests, services, or products in order to facilitate future business partnerships.We begin by furnishing a formal characterization of the corresponding multi-criteria optimization problem.We then address this problem by Answer Set Programming in order to solve real-world matchmaking instances, which were previously dealt with by special-purpose algorithms. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Gebser, M., Glase, T., Sabuncu, O., & Schaub, T. (2013). Matchmaking with answer set programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8148 LNAI, pp. 342–347). https://doi.org/10.1007/978-3-642-40564-8_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free