2011/06/10 by Frederick Maier, Maier, Frederick
Computer Science · #Advanced Algebra and Logic #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #I.2.3 #I.2.4 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.1106.1957
openalex publication_date 2011/06/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We provide a method of translating theories of Nute's defeasible logic into\nlogic programs, and a corresponding translation in the opposite direction.\nUnder certain natural restrictions, the conclusions of defeasible theories\nunder the ambiguity propagating defeasible logic ADL correspond to those of the\nwell-founded semantics for normal logic programs, and so it turns out that the\ntwo formalisms are closely related. Using the same translation of logic\nprograms into defeasible theories, the semantics for the ambiguity blocking\ndefeasible logic NDL can be seen as indirectly providing an ambiguity blocking\nsemantics for logic programs. We also provide antimonotone operators for both\nADL and NDL, each based on the Gelfond-Lifschitz (GL) operator for logic\nprograms. For defeasible theories without defeaters or priorities on rules, the\noperator for ADL corresponds to the GL operator and so can be seen as partially\ncapturing the consequences according to ADL. Similarly, the operator for NDL\ncaptures the consequences according to NDL, though in this case no restrictions\non theories apply. Both operators can be used to define stable model semantics\nfor defeasible theories.\n