论证理论
论证框架
计算机科学
理论计算机科学
语义学(计算机科学)
人工智能
程序设计语言
认识论
哲学
作者
Ridhwan Dewoprabowo,Johannes K. Fichte,Piotr Jerzy Gorczyca,Markus Hecher
标识
DOI:10.1007/978-3-031-15707-3_30
摘要
Abstract argumentation and Dung’s framework are popular for modeling and evaluating arguments in artificial intelligence. We consider various counting problems in abstract argumentation under practical aspects. We revisit algorithms and establish a framework that employs dynamic programming on tree decompositions for counting extensions of abstract argumentation frameworks under admissible, stable, and complete semantics. We provide an empirical evaluation and investigate conditions under which our approach is useful.
科研通智能强力驱动
Strongly Powered by AbleSci AI