{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:04:34Z","timestamp":1725739474002},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396168"},{"type":"electronic","value":"9783642396175"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39617-5_10","type":"book-chapter","created":{"date-parts":[[2013,7,4]],"date-time":"2013-07-04T08:17:56Z","timestamp":1372925876000},"page":"68-83","source":"Crossref","is-referenced-by-count":2,"title":["Modeling Stable Matching Problems with Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Sofie","family":"De Clercq","sequence":"first","affiliation":[]},{"given":"Steven","family":"Schockaert","sequence":"additional","affiliation":[]},{"given":"Martine","family":"De Cock","sequence":"additional","affiliation":[]},{"given":"Ann","family":"Now\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","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, New York (2003)"},{"issue":"12","key":"10_CR2","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G. Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Communications of the ACM\u00a054(12), 92\u2013103 (2011)","journal-title":"Communications of the ACM"},{"key":"10_CR3","unstructured":"Dell\u2019Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV. In: Gottlob, G., Walsh, T. (eds.) IJCAI, pp. 847\u2013852. M. Kaufmann (2003)"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0743-1066(95)94697-X","volume":"22","author":"P. Dung","year":"1995","unstructured":"Dung, P.: An argumentation-theoretic foundation for logic programming. The Journal of Logic Programming\u00a022(2), 151\u2013177 (1995)","journal-title":"The Journal of Logic Programming"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Transactions on Database Systems\u00a022(3), 364\u2013418 (1997)","journal-title":"ACM Transactions on Database Systems"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming\u00a03, 499\u2013518 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. The American Mathematical Monthly\u00a069(1), 9\u201315 (1962)","journal-title":"The American Mathematical Monthly"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D. Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discr. Appl. Math.\u00a011, 223\u2013232 (1985)","journal-title":"Discr. Appl. Math."},{"key":"10_CR9","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP\/SLP, pp. 1070\u20131080 (1988)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D. Gusfield","year":"1987","unstructured":"Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput.\u00a016(1), 111\u2013128 (1987)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"R. Irving","year":"1994","unstructured":"Irving, R.: Stable marriage and indifference. Discr. Appl. Math.\u00a048(3), 261\u2013272 (1994)","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2007.02.003","volume":"103","author":"R. Irving","year":"2007","unstructured":"Irving, R.: The cycle roommates problem: a hard case of kidney exchange. Inf. Process. Lett.\u00a0103(1), 1\u20134 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"R. Irving","year":"1987","unstructured":"Irving, R., Leather, P., Gusfield, D.: An efficient algorithm for the \u201coptimal\u201d stable marriage. J. ACM\u00a034(3), 532\u2013543 (1987)","journal-title":"J. ACM"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S.: A survey of the stable marriage problem and its variants. In: Proc. of ICKS 2008, pp. 131\u2013136. IEEE Computer Society (2008)","DOI":"10.1109\/ICKS.2008.7"},{"key":"10_CR15","unstructured":"Janhunen, T.: Representing normal programs with clauses. In: Proc. of the 16th European Conference on Artificial Intelligence, pp. 358\u2013362. IOS Press (2004)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03167200","volume":"10","author":"A. Kato","year":"1993","unstructured":"Kato, A.: Complexity of the sex-equal stable marriage problem. Japan Journal of Industrial and Applied Mathematics (JJIAM)\u00a010, 1\u201319 (1993)","journal-title":"Japan Journal of Industrial and Applied Mathematics (JJIAM)"},{"key":"10_CR17","unstructured":"Manlove, D.: Stable marriage with ties and unacceptable partners. Tech. rep., University of Glasgow, Department of Computing Science (1999)"},{"issue":"1-2","key":"10_CR18","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., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science\u00a0276(1-2), 261\u2013279 (2002)","journal-title":"Theoretical Computer Science"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01531080","volume":"1","author":"V. Marek","year":"1990","unstructured":"Marek, V., Nerode, A., Remmel, J.: A theory of nonmonotonic rule systems I. Ann. Math. Artif. Intell.\u00a01, 241\u2013273 (1990)","journal-title":"Ann. Math. Artif. Intell."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"McDermid, E., Irving, R.: Sex-equal stable matchings: Complexity and exact algorithms. Algorithmica, 1\u201326 (2012)","DOI":"10.1007\/s00453-012-9672-0"},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"A. Roth","year":"2005","unstructured":"Roth, A., S\u00f6mnez, T., \u00dcnver, M.: Pairwise kidney exchange. J. Econ. Theory\u00a0125(2), 151\u2013188 (2005)","journal-title":"J. Econ. Theory"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Roth, A., Sotomayor, M.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press (1990)","DOI":"10.1017\/CCOL052139015X"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Xu, H., Li, B.: Egalitarian stable matching for VM migration in cloud computing. In: IEEE Computer Communication Workshop, pp. 631\u2013636 (2011)","DOI":"10.1109\/INFCOMW.2011.5928889"}],"container-title":["Lecture Notes in Computer Science","Theory, Practice, and Applications of Rules on the Web"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39617-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T03:25:12Z","timestamp":1563333912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39617-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396168","9783642396175"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39617-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}