{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:33:44Z","timestamp":1742934824966,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415234"},{"type":"electronic","value":"9783642415241"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41524-1_11","type":"book-chapter","created":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T10:48:20Z","timestamp":1384512500000},"page":"195-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Descriptive Approach to Preferred Answer Sets"],"prefix":"10.1007","author":[{"given":"J\u00e1n","family":"\u0160efr\u00e1nek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"\u0160imko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,16]]},"reference":[{"issue":"1\u20132","key":"11_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0004-3702(99)00015-6","volume":"109","author":"G Brewka","year":"1999","unstructured":"Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artif. Intell. 109(1\u20132), 297\u2013356 (1999)","journal-title":"Artif. Intell."},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1017\/S1471068402001539","volume":"3","author":"J Delgrande","year":"2003","unstructured":"Delgrande, J., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory Pract. Logic Program. 3(2), 129\u2013187 (2003)","journal-title":"Theory Pract. Logic Program."},{"issue":"1\u20132","key":"11_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(00)00049-7","volume":"123","author":"J Delgrande","year":"2000","unstructured":"Delgrande, J., Schaub, T.: Expressing preferences in default logic. Artif. Intell. 123(1\u20132), 41\u201387 (2000)","journal-title":"Artif. Intell."},{"issue":"2","key":"11_CR4","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. Comput. Intell. 20(2), 308\u2013334 (2004)","journal-title":"Comput. Intell."},{"issue":"1\u20132","key":"11_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","volume":"170","author":"Y Dimopoulos","year":"1996","unstructured":"Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theoret. Comput. Sci. 170(1\u20132), 209\u2013244 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77, 321\u2013357 (1995)","journal-title":"Artif. Intell."},{"key":"11_CR7","unstructured":"Gabaldon, A.: A selective semantics for logic programs with preferences. In: Proceedings of the International Workshop on Nonmonotonic Reasoning, Action and Change (NRAC 11), Barcelona, Spain (2011)"},{"issue":"1\u20132","key":"11_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S1471068403001674","volume":"4","author":"AJ Garc\u00eda","year":"2004","unstructured":"Garc\u00eda, A.J., Simari, G.R.: Defeasible logic programming: an argumentative approach. Theory Pract. Logic Program. 4(1\u20132), 95\u2013138 (2004)","journal-title":"Theory Pract. Logic Program."},{"issue":"1\u20132","key":"11_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0004-3702(00)00054-0","volume":"3","author":"C Sakama","year":"2000","unstructured":"Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artif. Intell. 3(1\u20132), 185\u2013222 (2000)","journal-title":"Artif. Intell."},{"key":"11_CR10","unstructured":"Schaub, T., Wang, K.: A comparative study of logic programs with preference. In: IJCAI 2001, pp. 597\u2013602 (2001)"},{"key":"11_CR11","unstructured":"\u0160efr\u00e1nek, J.: Rethinking semantics of dynamic logic programs. In: Proceedings of the Workshop NMR (2006)"},{"key":"11_CR12","unstructured":"\u0160efr\u00e1nek, J.: Preferred answer sets supported by arguments. In: Proceedings of the Workshop NMR (2008)"},{"key":"11_CR13","unstructured":"\u0160efr\u00e1nek, J., \u0160imko, A.: Warranted derivation of preferred answer sets. In: Proceedings of WLP (2011)"},{"key":"11_CR14","unstructured":"\u0160imko, A.: Preferred answer sets - banned generating set. In: Proceedings of the Student Conference, Bratislava 2011, Faculty of Mathematics, Physics and Informatics, Comenius University, pp. 326\u2013333 (2011)"},{"key":"11_CR15","unstructured":"\u0160imko, A.: Selection of a preferred answer sets as a decision between generating sets. In: 6th Workshop on Intelligent and Knowledge Oriented Technologies, pp. 51\u201356 (2011)"},{"key":"11_CR16","unstructured":"\u0160imko, A.: Accepting the natural order of rules in a logic program with preferences. In: Proceedings of the Doctoral Consortium at ICLP 2011 (2011)"},{"key":"11_CR17","first-page":"336","volume-title":"PRIMA 2011. LNCS","author":"T Wakaki","year":"2011","unstructured":"Wakaki, T.: Preference-based argumentation handling dynamic preferences built on prioritized logic programming. In: Kinny, D., Hsu, J.-I., Governatori, G., Ghose, A.K. (eds.) PRIMA 2011. LNCS, vol. 7047, pp. 336\u2013348. Springer, Heidelberg (2011)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-44957-4_11","volume-title":"CL 2000. LNCS (LNAI)","author":"K Wang","year":"2000","unstructured":"Wang, K., Zhou, L.-Z., Lin, F.: Alternating fixpoint theory for logic programs with priority. In: Palamidessi, C., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, p. 164. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Applications of Declarative Programming and Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41524-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T14:46:47Z","timestamp":1674139607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-41524-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415234","9783642415241"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41524-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"16 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}