1. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for nonmonotonic reasoning. In Proc. of KR 98, pages 406–417, 1998. 187, 190
2. Y. Fujisima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions. In Proc. of IJCAI 99, pages 548–553, 1999. 186, 187, 188, 191
3. 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’l Conf. and Symp., pages 1070–1080. MIT Press, 1988. 187
4. H. Hoos and C. Boutilier. Solving combinatorial auctions using stochastic local search. In Proc. of AAAI’00, 2000. 186, 187, 191, 198
5. H. Kautz and B. Selman. Planning as satisfiability. In Proc. of ECAI-92, pages 359–363, 1992. 187