{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:06:16Z","timestamp":1725570376669},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425939"},{"type":"electronic","value":"9783540454021"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45402-0_14","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T22:10:11Z","timestamp":1290204611000},"page":"186-199","source":"Crossref","is-referenced-by-count":9,"title":["Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming"],"prefix":"10.1007","author":[{"given":"Chitta","family":"Baral","sequence":"first","affiliation":[]},{"given":"Cenk","family":"Uyan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,17]]},"reference":[{"key":"14_CR1","unstructured":"T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for nonmonotonic reasoning. In Proc. of KR 98, pages 406\u2013417, 1998. 187, 190"},{"key":"14_CR2","unstructured":"Y. Fujisima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions. In Proc. of IJCAI 99, pages 548\u2013553, 1999. 186, 187, 188, 191"},{"key":"14_CR3","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Logic Programming: Proc. of the Fifth Int\u2019l Conf. and Symp., pages 1070\u20131080. MIT Press, 1988. 187"},{"key":"14_CR4","unstructured":"H. Hoos and C. Boutilier. Solving combinatorial auctions using stochastic local search. In Proc. of AAAI\u201900, 2000. 186, 187, 191, 198"},{"key":"14_CR5","unstructured":"H. Kautz and B. Selman. Planning as satisfiability. In Proc. of ECAI-92, pages 359\u2013363, 1992. 187"},{"key":"14_CR6","unstructured":"K. Leyton-Brown, Y. Shoham, and M. Tennenholtz. An algorithm for multi-unit combinatorial auctions. In Proc. of AAAI\u201900, 2000. 186, 187, 188, 198"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"D. Monderer and M. Tennenholtz. Optimal auctions revisited. Artificial Intelligence, 2000. 186","DOI":"10.1016\/S0004-3702(00)00024-2"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"I. Niemela and P. Simons. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In Proc. 4th international conference on Logic programming and non-monotonic reasoning, pages 420\u2013429, 1997. 187, 198","DOI":"10.1007\/3-540-63255-7_32"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"402","DOI":"10.2307\/3003463","volume":"13","author":"S. Rassenti","year":"1982","unstructured":"S. Rassenti, V. Smith, and R. Bulfin. A combinatorial auction mechanism for airport time slot allocation. Bell J. of Economics, 13:402\u2013417, 1982. 186","journal-title":"Bell J. of Economics"},{"issue":"8","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M. Rothkopf","year":"1998","unstructured":"M. Rothkopf, A. Pekec, and R. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131\u20131147, 1998. 186, 187","journal-title":"Management Science"},{"key":"14_CR11","unstructured":"T. Sandholm. An implementation of the contract net protocol based on marginal cost calculations. In Proc. of AAAI 93, pages 256\u2013262, 1993. 186"},{"key":"14_CR12","unstructured":"T. Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In Proc. of IJCAI 99, pages 542\u2013547, 1999. 186, 187, 188, 198"},{"key":"14_CR13","unstructured":"T. Sandholm and S. Suri. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In Proc. of AAAI\u201900, 2000. 186, 187, 188, 190, 194, 195, 196, 198"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"P. Simons. Extending the stable model semantics with more expressive rules. In Proc. of International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR\u201999, 1999. 187, 189, 198","DOI":"10.1007\/3-540-46767-X_22"},{"key":"14_CR15","unstructured":"M. Tennenholtz. Some tractable combinatorial auctions. In Proc. of AAAI\u201900, 2000. 186, 187"},{"key":"14_CR16","unstructured":"M. Wellman, W. Walsh, P. Wurman, and J. Mackie-Mason. Auction protocols for decentralized scheduling. Games and Economic bahavior, 1999. 186"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45402-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T07:35:40Z","timestamp":1547883340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45402-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425939","9783540454021"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45402-0_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}