{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T20:40:11Z","timestamp":1712695211912},"reference-count":43,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T00:00:00Z","timestamp":1312848000000},"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":[[2013,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to those of the well-founded semantics for normal logic programs, and so it turns out that the two formalisms are closely related. Using the same translation of logic programs into defeasible theories, the semantics for the ambiguity blocking defeasible logic NDL can be seen as indirectly providing an ambiguity blocking semantics for logic programs. We also provide antimonotone operators for both ADL and NDL, each based on the Gelfond\u2013Lifschitz (GL) operator for logic programs. For defeasible theories without defeaters or priorities on rules, the operator for ADL corresponds to the GL operator and so can be seen as partially capturing the consequences according to ADL. Similarly, the operator for NDL captures the consequences according to NDL, though in this case no restrictions on theories apply. Both operators can be used to define stable model semantics for defeasible theories.<\/jats:p>","DOI":"10.1017\/s147106841100041x","type":"journal-article","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T09:22:39Z","timestamp":1312881759000},"page":"107-142","source":"Crossref","is-referenced-by-count":2,"title":["Interdefinability of defeasible logic and logic programming under the well-founded semantics"],"prefix":"10.1017","volume":"13","author":[{"given":"FREDERICK","family":"MAIER","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2011,8,9]]},"reference":[{"key":"S147106841100041X_ref43","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"S147106841100041X_ref42","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321991"},{"key":"S147106841100041X_ref38","doi-asserted-by":"publisher","DOI":"10.1145\/191843.191927"},{"key":"S147106841100041X_ref36","first-page":"69","volume-title":"Proc. of T\u00fcbingen Workshop on Semantic Networks and Nonmonotonic Reasoning","author":"Nute","year":"1989"},{"key":"S147106841100041X_ref32","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/oso\/9780198537472.003.0007","volume-title":"Handbook of Logic for Artificial Intelligence and Logic Programming","author":"Nute","year":"1994"},{"key":"S147106841100041X_ref31","volume-title":"LDR: A Logic for Defeasible Resasoning","author":"Nute","year":"1986"},{"key":"S147106841100041X_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90061-N"},{"key":"S147106841100041X_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-009-9492-1"},{"key":"S147106841100041X_ref25","first-page":"299","volume-title":"Proc. of 16th National Conference on Artificial Intelligence (AAAI '99)","author":"Maher","year":"1999"},{"key":"S147106841100041X_ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(87)90007-0"},{"key":"S147106841100041X_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90057-7"},{"key":"S147106841100041X_ref21","first-page":"27","volume-title":"Proc. of 6th Pacific Rim international conference on Artificial intelligence (PRICAI '00)","author":"Governatori","year":"2000"},{"key":"S147106841100041X_ref30","first-page":"243","volume-title":"Proc. of 1989 North American Conference on Logic Programming (NACLP '89)","author":"Marek","year":"1989"},{"key":"S147106841100041X_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S147106841100041X_ref19","first-page":"1070","volume-title":"Proc. of 5th International Conference on Logic Programming (ICLP '88)","author":"Gelfond","year":"1988"},{"key":"S147106841100041X_ref18","unstructured":"Donnelly S. 1999. Semantics, Soundness, and Incompleteness for a Defeasible Logic, Master's thesis. The University of Georgia, Athens, Georgia."},{"key":"S147106841100041X_ref17","first-page":"121","volume-title":"Proc. of 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01)","author":"Brewka","year":"2001"},{"key":"S147106841100041X_ref16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1613\/jair.284","article-title":"Well-founded semantics for extended logic programs with dynamic preferences","volume":"4","author":"Brewka","year":"1996","journal-title":"Journal of Artificial Intelligence Research"},{"key":"S147106841100041X_ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010551204574"},{"key":"S147106841100041X_ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90014-4"},{"key":"S147106841100041X_ref14","doi-asserted-by":"publisher","DOI":"10.1080\/09528139008953720"},{"key":"S147106841100041X_ref12","first-page":"256","volume-title":"Proc. of 20th International Joint Conference on Artifical Intelligence (IJCAI '07)","author":"Billington","year":"2007"},{"key":"S147106841100041X_ref6","first-page":"459","volume-title":"Proc. of 14th European Conference on Artificial Intelligence (ECAI '00)","author":"Antoniou","year":"2000"},{"key":"S147106841100041X_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8851-5_12"},{"key":"S147106841100041X_ref40","first-page":"434","volume-title":"Proc. of 6th International Conference Logic Programming and Nonmonotonic Reasoning (LPNMR '01)","author":"Syrj\u00e4nen","year":"2001"},{"key":"S147106841100041X_ref39","unstructured":"Schaub T. and Wang K. 2002. Preferred well-founded semantics for logic programming by alternating fixpoints. Preliminary report. In Proc. of 9th International Workshop on Non-Monotonic Reasoning (NMR '02), 238\u2013246."},{"key":"S147106841100041X_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87803-2_5"},{"key":"S147106841100041X_ref26","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213001000623"},{"key":"S147106841100041X_ref34","first-page":"201","volume-title":"Norms, Logics and Information Systems","author":"Nute","year":"1999"},{"key":"S147106841100041X_ref35","first-page":"151","volume-title":"Proc. of 14th International Conference on Applications of Prolog (INAP '01)","author":"Nute","year":"2003"},{"key":"S147106841100041X_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11853886_26"},{"key":"S147106841100041X_ref9","unstructured":"Billington D. 2004. A plausible logic which detects loops. In Proc. of 10th International Workshop on Nonmonotonic Reasoning (NMR '04), 65\u201371."},{"key":"S147106841100041X_ref2","first-page":"13","volume-title":"Proc. of 14th Australian Joint Conference on Artificial Intelligence (AUS-AI '01)","author":"Antoniou","year":"2001"},{"key":"S147106841100041X_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/371316.371517"},{"key":"S147106841100041X_ref22","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/14.5.675"},{"key":"S147106841100041X_ref10","first-page":"796","volume-title":"Proc. of 18th Australian Joint Conference on Artificial Intelligence (AUS\u2013AI '05)","author":"Billington","year":"2005"},{"key":"S147106841100041X_ref41","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"S147106841100041X_ref1","doi-asserted-by":"publisher","DOI":"10.1002\/int.20147"},{"key":"S147106841100041X_ref3","first-page":"405","volume-title":"Proc. of 17th National Conference on Artificial Intelligence (AAAI '00","author":"Antoniou","year":"2000"},{"key":"S147106841100041X_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068406002778"},{"key":"S147106841100041X_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF00881799"},{"key":"S147106841100041X_ref8","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/3.4.379"},{"key":"S147106841100041X_ref11","first-page":"812","volume-title":"Proc. of 18th Australian Joint Conference on Artificial Intelligence (AUS\u2013AI '05)","author":"Billington","year":"2005"}],"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\/S147106841100041X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T20:06:14Z","timestamp":1712693174000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106841100041X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,9]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["S147106841100041X"],"URL":"https:\/\/doi.org\/10.1017\/s147106841100041x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,9]]}}}