首页 | 本学科首页   官方微博 | 高级检索  
     


A modular translation from defeasible nets to defeasible logics
Authors:DAVID BILLINGTON  KOEN DE COSTER  DONALD NUTE
Affiliation:1. School of Computing and Information Technology, Griffith University , Nathan, Brisbane, Queensland, 4111 E-mail: Australia email: ACSNet db@gucis.cit.gu.oz.au;2. Department of Mathematics and Computer Science , University of Antwerp, UIA , Universiteitsplein I, Wilrijk, B2610, Belgium;3. Department of Philosophy , University of Georgia , Athens, GA, 30602, USA
Abstract:Abstract

The sceptical inheritance nets introduced in Horty et al. Proceedings of AAAI-87 (1987):358-363] are translated into a version of Nute's defeasible logic. Moreover this translation is modular in the sense of Thomason and Horty Non-Monotonic Reasoning. Springer-Verlag (1989):234]. Apart from the importance of relating two nonmonotonic reasoning formalisms, this result shows that the reasoning mechanisms underlying defeasible logic and defeasible nets are the same. Yet they were invented independently and set in totally different contexts. This is perhaps some evidence that the underlying nonmonotonic reasoning mechanism is mainly correct. We also observe that since defeasible logics can contain both absolute and defeasible rules, they provided a uniform setting for considering nets which contain both strict and defeasible arcs.
Keywords:rough set  censored production rules  knowledge discovery  rule learning  approximation spaces
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号