{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:10Z","timestamp":1725566110106},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159176"},{"type":"electronic","value":"9783642159183"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15918-3_12","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T12:39:24Z","timestamp":1284554364000},"page":"149-163","source":"Crossref","is-referenced-by-count":1,"title":["Defeasibility in Answer Set Programs via Argumentation Theories"],"prefix":"10.1007","author":[{"given":"Hui","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kifer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Grosof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1017\/S1471068406002778","volume":"6","author":"G. Antoniou","year":"2006","unstructured":"Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Embedding defeasible logic into logic programming. Theory and Practice of Logic Programming (TPLP)\u00a06(6), 703\u2013735 (2006)","journal-title":"Theory and Practice of Logic Programming (TPLP)"},{"issue":"1-2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01530761","volume":"12","author":"R. Ben-Eliyahu","year":"1994","unstructured":"Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Ann. Math. Artif. Intell.\u00a012(1-2), 53\u201387 (1994)","journal-title":"Ann. Math. Artif. Intell."},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-94-015-9383-0_3","volume-title":"Intellectics and Computational Logic \u2013 Papers in Honour of Wolfgang Bibel","author":"G. Brewka","year":"2000","unstructured":"Brewka, G., Eiter, T.: Prioritizing default logic. In: Intellectics and Computational Logic \u2013 Papers in Honour of Wolfgang Bibel, pp. 27\u201345. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0743-1066(93)90039-J","volume":"15","author":"W. Chen","year":"1993","unstructured":"Chen, W., Kifer, M., Warren, D.: HiLog: A foundation for higher-order logic programming. Journal of Logic Programming\u00a015(3), 187\u2013230 (1993)","journal-title":"Journal of Logic Programming"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1017\/S1471068402001539","volume":"2","author":"J. Delgrande","year":"2003","unstructured":"Delgrande, J., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming\u00a02, 129\u2013187 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"12","key":"12_CR6","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1111\/j.0824-7935.2004.00240.x","volume":"20","author":"J. Delgrande","year":"2004","unstructured":"Delgrande, J., Schaub, T., Tompits, H., Wang, K.: A classification and survey of preference handling approaches in nonmonotonic reasoning. Computational Intelligence\u00a020(12), 308\u2013334 (2004)","journal-title":"Computational Intelligence"},{"issue":"1\/2","key":"12_CR7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3233\/FI-1996-281205","volume":"XXVIII","author":"J. Dix","year":"1996","unstructured":"Dix, J., Gottlob, G., Marek, V.: Reducing disjunctive to non-disjunctive semantics by shift-operations. Fundamenta Informaticae\u00a0XXVIII(1\/2), 87\u2013100 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"12_CR8","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), 463\u2013498 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"12_CR9","first-page":"620","volume":"38","author":"A.V. Gelder","year":"1991","unstructured":"Gelder, A.V., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM\u00a038, 620\u2013650 (1991)","journal-title":"Journal of the ACM"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S1574-6526(07)03007-6","volume-title":"Handbook of Knowledge Representation","author":"M. Gelfond","year":"2008","unstructured":"Gelfond, M.: Answer sets. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, pp. 285\u2013316. Elsevier, Amsterdam (2008)"},{"key":"12_CR11","first-page":"1070","volume-title":"Proceedings of ICLP\/SLP","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP\/SLP, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"12_CR12","unstructured":"Gelfond, M., Przymusinska, H., Lifschitz, V., Truszczynski, M.: Disjunctive defaults. In: Proceedings of the International Conference on Knowledge Representation and Reasoning, pp. 230\u2013237 (1991)"},{"key":"12_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BFb0054795","volume-title":"Logic Programming and Knowledge Representation","author":"M. Gelfond","year":"1998","unstructured":"Gelfond, M., Son, T.: Reasoning with prioritized defaults. In: Dix, J., Moniz Pereira, L., Przymusinski, T.C. (eds.) LPKR 1997. LNCS (LNAI), vol.\u00a01471, pp. 164\u2013223. Springer, Heidelberg (1998)"},{"key":"12_CR14","unstructured":"Grosof, B.: A courteous compiler from generalized courteous logic programs to ordinary logic programs. Technical Report Supplementary Update Follow-On to RC 21472, IBM (July 1999)"},{"key":"12_CR15","unstructured":"Kifer, M.: FLORA-2: An object-oriented knowledge base language. The FLORA-2 Web Site, http:\/\/flora.sourceforge.net"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/210332.210335","volume":"42","author":"M. Kifer","year":"1995","unstructured":"Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. Journal of ACM\u00a042, 741\u2013843 (1995)","journal-title":"Journal of ACM"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"12_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. Lloyd","year":"1987","unstructured":"Lloyd, J.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"12_CR19","unstructured":"Morales, A.R., Tu, P.H., Son, T.C.: An extension to conformant planning using logic programming. In: IJCAI, pp. 1991\u20131996 (2007)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Wan, H., Grosof, B., Kifer, M., Fodor, P., Liang, S.: Logic programming with defaults and argumentation theories. In: ICLP, pp. 432\u2013448 (2009)","DOI":"10.1007\/978-3-642-02846-5_35"},{"key":"12_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-44957-4_11","volume-title":"Computational Logic - CL 2000","author":"K. Wang","year":"2000","unstructured":"Wang, K., Zhou, L., Lin, F.: Alternating fixpoint theory for logic programs with priority. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 164\u2013178. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Web Reasoning and Rule Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15918-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T18:59:24Z","timestamp":1591901964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15918-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159176","9783642159183"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15918-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}