{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:27:56Z","timestamp":1755599276091},"reference-count":35,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T00:00:00Z","timestamp":1503360000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. This limits their usefulness in contexts where different intuitions are at play in different aspects of a problem. In particular, in some legal settings, different actors have different burdens of proof, which might be expressed as reasoning in different defeasible logics. In this paper, we introduce annotated defeasible logic as a flexible formalism permitting multiple forms of defeasibility, and establish some properties of the formalism.<\/jats:p>","DOI":"10.1017\/s1471068417000266","type":"journal-article","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T12:14:31Z","timestamp":1503404071000},"page":"819-836","source":"Crossref","is-referenced-by-count":8,"title":["Annotated defeasible logic"],"prefix":"10.1017","volume":"17","author":[{"given":"GUIDO","family":"GOVERNATORI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHAEL J.","family":"MAHER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2017,8,22]]},"reference":[{"key":"S1471068417000266_ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841100041X"},{"key":"S1471068417000266_ref33","doi-asserted-by":"crossref","unstructured":"Wan H. , Grosof B. N. , Kifer M. , Fodor P. and Liang S. 2009. Logic programming with defaults and argumentation theories. In Proc. of ICLP, 432\u2013448.","DOI":"10.1007\/978-3-642-02846-5_35"},{"key":"S1471068417000266_ref11","first-page":"31","volume-title":"Proc. of 13th International Conference on Artificial Intelligence and Law","author":"Governatori","year":"2011"},{"key":"S1471068417000266_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-009-9492-1"},{"key":"S1471068417000266_ref14","first-page":"57","volume-title":"Proc. of 23rd Annual Conference on Legal Knowledge and Information Systems","author":"Governatori","year":"2010"},{"key":"S1471068417000266_ref20","unstructured":"Maher M. J. 2002. A model-theoretic semantics for defeasible logic. In Proc. of ICLP 2002 Workshop Paraconsistent Computational Logic, 67\u201380."},{"key":"S1471068417000266_ref22","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000367"},{"key":"S1471068417000266_ref17","first-page":"289","article-title":"Negation in logic programming","volume":"4","author":"Kunen","year":"1987","journal-title":"Journal of Logic and Computation"},{"key":"S1471068417000266_ref8","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Gelder","year":"1991","journal-title":"Journal of The Academy of Clinical Microbiologists"},{"key":"S1471068417000266_ref15","unstructured":"Grosof B. N. 1997. Prioritized conflict handling for logic programs. In Proc. of ILPS, 197\u2013211."},{"key":"S1471068417000266_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(85)80005-4"},{"key":"S1471068417000266_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068412000294"},{"key":"S1471068417000266_ref1","first-page":"405","volume-title":"Proc. of AAAI National Conference on Artificial Intelligence","author":"Antoniou","year":"2000"},{"key":"S1471068417000266_ref34","doi-asserted-by":"crossref","first-page":"81","DOI":"10.3233\/SW-140140","article-title":"Defeasibility in answer set programs with defaults and argumentation rules","volume":"6","author":"Wan","year":"2015","journal-title":"Semantic Web"},{"key":"S1471068417000266_ref9","unstructured":"Gelfond M. and Lifschitz V. 1988. The stable model semantics for logic programming. In Proc. of JICSLP, 1070\u20131080."},{"key":"S1471068417000266_ref28","doi-asserted-by":"publisher","DOI":"10.1080\/19462160903564592"},{"key":"S1471068417000266_ref25","unstructured":"Maher M. J. , Governatori G. and Lam H. P. 2011. Well-founded defeasible logics, Reasoning Research Institute. Technical report."},{"key":"S1471068417000266_ref29","doi-asserted-by":"crossref","unstructured":"Prakken H. and Sartor G. 2007. Formalising arguments about the burden of persuasion. In Proc. of 11th International Conference on Artificial Intelligence and Law, A. Gardner and R. Winkels , Eds. ACM, 97\u2013106.","DOI":"10.1145\/1276318.1276338"},{"key":"S1471068417000266_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80053-4"},{"key":"S1471068417000266_ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018947420290"},{"key":"S1471068417000266_ref16","first-page":"335","article-title":"Theory of generalized annotated logic programming and its applications","volume":"12","author":"Kifer","year":"1992","journal-title":"Journal of Logic and Computation"},{"key":"S1471068417000266_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)00104-E"},{"key":"S1471068417000266_ref24","first-page":"299","volume-title":"Proc. of AAAI National Conference on Artificial Intelligence","author":"Maher","year":"1999"},{"key":"S1471068417000266_ref19","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001168"},{"key":"S1471068417000266_ref18","doi-asserted-by":"crossref","unstructured":"Maher M. J. 2000. A denotational semantics of defeasible logic. In Proc. of 1st International Conference on Computational Logic \u2013 CL 2000, 24\u201328 July, 2000, London, UK, 209\u2013222.","DOI":"10.1007\/3-540-44957-4_14"},{"key":"S1471068417000266_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_12"},{"key":"S1471068417000266_ref32","first-page":"319","article-title":"DefLog: On the logical interpretation of prima facie justified assumptions","volume":"13","author":"Verheij","year":"2003","journal-title":"Journal of Computer and System Sciences"},{"key":"S1471068417000266_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1838552.1838558"},{"key":"S1471068417000266_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00060-6"},{"key":"S1471068417000266_ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000053"},{"key":"S1471068417000266_ref12","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/14.5.675"},{"key":"S1471068417000266_ref23","first-page":"1","article-title":"Relating concrete defeasible reasoning formalisms and abstract argumentation","volume":"153","author":"Maher","year":"2017","journal-title":"Fundamenta Informaticae"},{"key":"S1471068417000266_ref31","unstructured":"Sacc\u00e0 D. and Zaniolo C. 1990. Stable models and non-determinism in logic programs with negation. In Proc. of PODS, 205\u2013217."},{"key":"S1471068417000266_ref30","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","article-title":"The well-founded semantics coincides with the three-valued stable semantics","volume":"13","author":"Przymusinski","year":"1990","journal-title":"Fundamenta Informaticae"},{"key":"S1471068417000266_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2014.12.004"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068417000266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T16:13:32Z","timestamp":1659370412000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068417000266\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,22]]},"references-count":35,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["S1471068417000266"],"URL":"https:\/\/doi.org\/10.1017\/s1471068417000266","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,22]]}}}