{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T22:40:08Z","timestamp":1703976008864},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00033-6","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T17:15:47Z","timestamp":1035825347000},"page":"499-529","source":"Crossref","is-referenced-by-count":15,"title":["Relating defeasible and normal logic programming through transformation properties"],"prefix":"10.1016","volume":"290","author":[{"given":"Carlos Iv\u00e1n","family":"Ches\u00f1evar","sequence":"first","affiliation":[]},{"given":"J\u00fcrgen","family":"Dix","sequence":"additional","affiliation":[]},{"given":"Frieder","family":"Stolzenburg","sequence":"additional","affiliation":[]},{"given":"G.R.Guillermo Ricardo","family":"Simari","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(02)00033-6_BIB1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00883931","article-title":"A logic programming system for non-monotonic reasoning","volume":"14","author":"Alferes","year":"1995","journal-title":"J. Automated Reasoning"},{"issue":"3","key":"10.1016\/S0304-3975(02)00033-6_BIB2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0743-1066(96)00115-X","article-title":"Characterizations of the disjunctive stable semantics by partial evaluation","volume":"32","author":"Brass","year":"1997","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/S0304-3975(02)00033-6_BIB3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1005952908693","article-title":"Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA","volume":"20","author":"Brass","year":"1998","journal-title":"J. Automated Reasoning"},{"issue":"3","key":"10.1016\/S0304-3975(02)00033-6_BIB4","first-page":"167","article-title":"Semantics of (disjunctive) logic programs based on partial evaluation","volume":"38","author":"Brass","year":"1999","journal-title":"J. Logic Programming"},{"issue":"5","key":"10.1016\/S0304-3975(02)00033-6_BIB5","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1017\/S147106840100103X","article-title":"Transformation-based bottom-up computation of the well-founded model","volume":"1","author":"Brass","year":"2001","journal-title":"Theory Practice Logic Programming"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB6","unstructured":"G. Brewka, J. Dix, Knowledge representation with extended logic programs, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, 2nd ed., Vol. 6, Chap. 6, Methodologies, Reidel Publishers shortened version also appeared in: Dix, Pereira, Przymusinski (Eds.), Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, Vol. 1471, Springer, Berlin, 2002, pp. 1\u201355, 1998."},{"key":"10.1016\/S0304-3975(02)00033-6_BIB7","unstructured":"C.I. Ches\u00f1evar, G.R. Simari, Modeling defeasibility into an extended logic programming setting using an abstract argumentation framework, in: Proc. Argentinean Symp. on Artificial Intelligence, JAIIO, Buenos Aires, Argentina, 1999, pp. 71\u201389."},{"key":"10.1016\/S0304-3975(02)00033-6_BIB8","unstructured":"C. Ches\u00f1evar, J. Dix, G. Simari, F. Stolzenburg, Relating defeasible and normal logic programming through transformation properties, in: Proc. 6th Argentinean Congress on Computer Science, CACIC\u20192000, JAIIO, Buenos Aires, Argentina, 2000a, pp. 371\u2013381."},{"issue":"4","key":"10.1016\/S0304-3975(02)00033-6_BIB9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/371578.371581","article-title":"Logical models of argument","volume":"32","author":"Ches\u00f1evar","year":"2000","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB10","doi-asserted-by":"crossref","unstructured":"J. Dix, F. Stolzenburg, A framework to incorporate non-monotonic reasoning into constraint logic programming, J. Logic Programming 37(1\u20133), 47\u201376, in: Kim Marriott, Peter J. Stuckey (guest Eds.), special issue on Constraint Logic Programming, 1998.","DOI":"10.1016\/S0743-1066(98)10003-1"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB11","doi-asserted-by":"crossref","unstructured":"J. Dix, U. Furbach, I. Niemel\u00e4, Nonmonotonic reasoning: towards efficient calculi and implementations, in: A. Voronkov, A. Robinson (Eds.), Handbook of Automated Reasoning, Vol. 2, chap. 18, Elsevier-Science-Press, New York, 2001a, pp. 1121\u20131234.","DOI":"10.1016\/B978-044450813-3\/50021-7"},{"issue":"1\u20133","key":"10.1016\/S0304-3975(02)00033-6_BIB12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0168-0072(00)00044-0","article-title":"A general theory of confluent rewriting systems for logic programming and its applications","volume":"108","author":"Dix","year":"2001","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB13","series-title":"Nonmonotonic Extensions of Logic Programming, Lecture Notes in Artificial Intelligence, Vol. 1216","first-page":"1","article-title":"Prolegomena to logic programming for non-monotonic reasoning","author":"Dix","year":"1997"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB14","series-title":"Proc. 2nd German\u2013Argentinian Workshop on Information Technology","first-page":"39","article-title":"Automating defeasible reasoning with logic programming (DeReLoP)","author":"Dix","year":"1999"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB15","unstructured":"P.M. Dung, On the acceptability of arguments and its fundamental role in nomonotonic reasoning and logic programming, in: Proc. 13th. Internat. Joint Conf. in Artificial Intelligence (IJCAI), Chamb\u00e9ry, France, 1993."},{"key":"10.1016\/S0304-3975(02)00033-6_BIB16","unstructured":"A.J. Garc\u0131́a, Defeasible logic programming: definition and implementation, Master's Thesis, Dep. de Ciencias de la Computaci\u00f3n, Universidad Nacional del Sur, Bah\u0131́a Blanca, Argentina, 1997."},{"key":"10.1016\/S0304-3975(02)00033-6_BIB17","unstructured":"A.J. Garc\u0131́a, Defeasible logic programming: definition, operational semantics and parallelism. Ph.D. Thesis, Computer Science Department, Universidad Nacional del Sur, Bah\u0131́a Blanca, Argentina, 2000."},{"key":"10.1016\/S0304-3975(02)00033-6_BIB18","unstructured":"A.J. Garc\u0131́a, G.R. Simari, C.I. Ches\u00f1evar, An argumentative framework for reasoning with inconsistent and incomplete information, in: J. Bell, Z. Huang, J.-J. Meyer, M. Ryan, M. Sergot, S. Steel, M. Woolridge (Eds.), Workshop on Practical Reasoning and Rationality, 13th Biennial European Conference on Artificial Intelligence (ECAI-98), 1998, pp. 13\u201320."},{"key":"10.1016\/S0304-3975(02)00033-6_BIB19","series-title":"5th Conf. Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB20","series-title":"Proc. Internat. Conf. Logic Programming","first-page":"579","article-title":"Logic programs with classical negation","author":"Gelfond","year":"1990"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB21","doi-asserted-by":"crossref","unstructured":"M. Gelfond, V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing 9 (1990) 365\u2013387 (Extended abstract appeared in: Logic Programs with Classical Negation, Proc. 7th Internat. Logic Programming Conference, Jerusalem, 1991, 1990, MIT Press, Cambridge, MA, pp. 579\u2013597).","DOI":"10.1007\/BF03037169"},{"issue":"4","key":"10.1016\/S0304-3975(02)00033-6_BIB22","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1093\/logcom\/9.4.515","article-title":"Computing argumentation in logic programming","volume":"9","author":"Kakas","year":"1999","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0304-3975(02)00033-6_BIB23","doi-asserted-by":"crossref","unstructured":"V. Lifschitz, Circumscription, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Clarendon, Oxford, 1994, pp. 297\u2013353.","DOI":"10.1093\/oso\/9780198537472.003.0006"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB24","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB25","series-title":"Handbook of Logic and Artificial Intelligence","first-page":"353","article-title":"Defeasible logic","author":"Nute","year":"1994"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB26","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1207\/s15516709cog1104_4","article-title":"Defeasible reasoning","volume":"11","author":"Pollock","year":"1987","journal-title":"Cognitive Sci."},{"key":"10.1016\/S0304-3975(02)00033-6_BIB27","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/11663081.1997.10510900","article-title":"Argument-based logic programming with defeasible priorities","volume":"7","author":"Prakken","year":"1997","journal-title":"J. Appl. Non-classical Logics"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB28","doi-asserted-by":"crossref","unstructured":"H. Prakken, G. Vreeswijk, Logics for defeasible argumentation, in: D. Gabbay (Ed.), Handbook of Philosophical Logic, Kluwer Academic Publisher, Dordrecht, 2002, to appear.","DOI":"10.1007\/978-94-017-0456-4_3"},{"issue":"1,2","key":"10.1016\/S0304-3975(02)00033-6_BIB29","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB30","series-title":"a Controversy-Oriented Approach to the Theory of Knowledge","article-title":"Dialectics","author":"Rescher","year":"1997"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB31","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0004-3702(92)90069-A","article-title":"A mathematical treatment of defeasible reasoning and its implementation","volume":"53","author":"Simari","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB32","unstructured":"G.R. Simari, C.I. Ches\u00f1evar, A.J. Garc\u0131́a, The role of dialectics in defeasible argumentation, in: R. Peralta (Ed.), Anales de la XIV Conferencia Internacional de la Sociedad Chilena para Ciencias de la Computaci\u00f3n, Universidad de Concepci\u00f3n, Concepci\u00f3n (Chile), 1994."},{"key":"10.1016\/S0304-3975(02)00033-6_BIB33","doi-asserted-by":"crossref","unstructured":"A. van Gelder, K.A. Ross, J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in: Proc. 7th Symposion on Principles of Database Systems, 1988, pp. 221\u2013230.","DOI":"10.1145\/308386.308444"},{"issue":"3","key":"10.1016\/S0304-3975(02)00033-6_BIB34","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"van Gelder","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00033-6_BIB35","doi-asserted-by":"crossref","unstructured":"G.A. Vreeswijk, Studies in defeasible argumentation, Ph.D. Thesis, Vrije University, Amsterdam, Holland, 1993.","DOI":"10.1093\/logcom\/3.3.317"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000336?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000336?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T22:19:42Z","timestamp":1703974782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502000336"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00033-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}
