{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:35Z","timestamp":1725565415364},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_25","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"356-370","source":"Crossref","is-referenced-by-count":5,"title":["Compiling Prioritized Circumscription into Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Toshiko","family":"Wakaki","sequence":"first","affiliation":[]},{"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/3-540-45757-7_37","volume-title":"Logics in Artificial Intelligence","author":"G. Brewka","year":"2002","unstructured":"Brewka, G., Niemel\u00e4, I., Syrj\u00e4nen, T.: Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 444\u2013455. Springer, Heidelberg (2002)"},{"key":"25_CR2","unstructured":"Brewka, G., Niemel\u00e4, I., Truszczynski, M.: Answer set Optimization. In: Proc. of 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pp. 867\u2013872 (2003)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","volume":"44","author":"M. Cadoli","year":"1992","unstructured":"Cadoli, M.: The complexity of model checking for circumscriptive formulae. Information Processing Letters\u00a044, 113\u2013118 (1992)","journal-title":"Information Processing Letters"},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1017\/S1471068402001539","volume":"3","author":"J.P. Delgrande","year":"2003","unstructured":"Delgrande, J.P., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming\u00a03(2), 129\u2013187 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","volume":"114","author":"T. Eiter","year":"1993","unstructured":"Eiter, T., Gottlob, G.: Propositional circumscription and extended closed-world reasoning are \u03a0p 2 -Complete. Theoretical Computer Science\u00a0114(2), 231\u2013245 (1993)","journal-title":"Theoretical Computer Science"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","first-page":"364","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol.\u00a01265, pp. 364\u2013375. Springer, Heidelberg (1997)"},{"issue":"4-5","key":"25_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1017\/S1471068403001753","volume":"3","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred answer sets by meta-interpretation in answer set programming. Theory and Practice of Logic Programming\u00a03(4-5), 463\u2013498 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"25_CR8","unstructured":"Gelfond, M., Lifschitz, V.: Compiling circumscriptive theories into logic programs. In: Proc. of AAAI 1988, pp. 455\u2013459 (1988)"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0004-3702(92)90030-2","volume":"56","author":"K. Inoue","year":"1992","unstructured":"Inoue, K.: Linear resolution for consequence finding. Artificial Intelligence\u00a056, 301\u2013353 (1992)","journal-title":"Artificial Intelligence"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Inoue, K., Sakama, C.: On positive occurrences of negation as failure. In: Proc. of KR 1994, pp. 293\u2013304 (1994)","DOI":"10.1016\/B978-1-4832-1452-8.50123-8"},{"key":"25_CR12","unstructured":"Janhunen, T., Niemel\u00e4, I., Simons, P., You, J.: Unfolding Partiality and Disjunctions in Stable Model Semantics. In: Proc. of KR 2000, pp. 411\u2013422 (2000)"},{"key":"25_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-45757-7_41","volume-title":"Logics in Artificial Intelligence","author":"T. Janhunen","year":"2002","unstructured":"Janhunen, T., Oikarinen, E.: Testing the equivalence of logic programs under stable models semantics. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 493\u2013504. Springer, Heidelberg (2002)"},{"key":"25_CR14","unstructured":"Lifschitz, V.: Computing circumscription. In: Proc. of IJCAI 1985, pp. 121\u2013127 (1985)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J.: Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence\u00a028, 89\u2013116 (1986)","journal-title":"Artificial Intelligence"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1006\/inco.1995.1005","volume":"116","author":"A. Nerode","year":"1995","unstructured":"Nerode, A., Ng, R.T., Subrahmanian, V.S.: Computing circumscriptive databases, part I: theory and algorithms. Information and Computation\u00a0116, 58\u201380 (1995)","journal-title":"Information and Computation"},{"key":"25_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-24609-1_17","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"E. Oikarinen","year":"2003","unstructured":"Oikarinen, E., Janhunen, T.: Verifying the equivalence of logic programs in the disjunctive case. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 180\u2013193. Springer, Heidelberg (2003)"},{"key":"25_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-24609-1_20","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"G. Pfeifer","year":"2003","unstructured":"Pfeifer, G.: Improving the Model Generation\/Checking Interplay to Enhance the Evaluation of Disjunctive Programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 220\u2013233. Springer, Heidelberg (2003)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-59487-6_25","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C. Sakama","year":"1995","unstructured":"Sakama, C., Inoue, K.: Embedding circumscriptive theories in general disjunctive programs. In: Marek, V.W., Truszczy\u0144ski, M., Nerode, A. (eds.) LPNMR 1995. LNCS, vol.\u00a0928, pp. 344\u2013357. Springer, Heidelberg (1995)"},{"key":"25_CR20","unstructured":"Sakama, C., Inoue, K.: Representing priorities in logic programs. In: Proc. of Joint Int. Conf. and Sympo. on Logic Programming (JICSLP 1996), pp. 82\u201396 (1996)"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0004-3702(00)00054-0","volume":"123","author":"C. Sakama","year":"2000","unstructured":"Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence\u00a0123, 185\u2013222 (2000)","journal-title":"Artificial Intelligence"},{"key":"25_CR22","unstructured":"Satoh, K.: Formalizing soft constraints by interpretation ordering. In: Proc. of 9th European Conference on Artificial Intelligence (ECAI 1990), pp. 585\u2013590 (1990)"},{"key":"25_CR23","unstructured":"Wakaki, T., Satoh, K.: Compiling prioritized circumscription into extended logic programs. In: Proc. of IJCAI 1997, pp. 182\u2013187 (1997)"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-39813-4_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Wakaki","year":"2003","unstructured":"Wakaki, T., Inoue, K., Sakama, C., Nitta, K.: Computing preferred answer sets in answer set programming. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 259\u2013273. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:24:38Z","timestamp":1620012278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}