论证理论
计算机科学
理论计算机科学
认识论
哲学
标识
DOI:10.1093/logcom/exu007
摘要
This article is about busting loops in abstract argumentation networks. We propose several approaches to how to deal with networks which have loops (such as even or odd cycles) and get new extensions which are ‘in’, ‘out’ extensions, with no undecided elements.
科研通智能强力驱动
Strongly Powered by AbleSci AI