无限论证结构的自动机
Automata for Infinite Argumentation Structures
摘要:
抽象论证框架(afs)理论主要集中在有限的结构上,尽管在许多重要的语境中,论证可以被看作是一个涉及无限对象的过程。为了解决这个问题,在本文中,我们提出了一种新的方法来描述无限自动对焦使用的工具,从形式语言理论。特别地,通过确定性有限自动机所识别的语言来指定可能的无穷多个参数,同时引入一种合适的形式化方法--攻击表达式来描述参数之间的攻击关系.所提出的方法,以满足一些理想的属性,不能通过其他“天真”使用形式语言。特别是,该方法被证明是足够的表达捕捉(除了任何任意的有限结构)的各种各样的无限AF,包括两个主要的例子,从以前的文献和两个样本情况下,从多智能体谈判和环境智能领域。在计算方面,我们证明了几个决策和建设问题,这是已知的多项式时间可解的有限自动对焦系统是可判定的背景下提出的形式主义,我们提供了相关的算法。此外,我们还得到了关于有限afs情形的一些结果。
英文摘要:
The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this limitation, in this paper we propose a novel approach for describing infinite afs using tools from formal language theory. In particular, the possibly infinite set of arguments is specified through the language recognized by a deterministic finite automaton while a suitable formalism, called attack expression, is introduced to describe the relation of attack between arguments. The proposed approach is shown to satisfy some desirable properties which can not be achieved through other "naive" uses of formal languages. In particular, the approach is shown to be expressive enough to capture (besides any arbitrary finite structure) a large variety of infinite afs including two major examples from previous literature and two sample cases from the domains of multi-agent negotiation and ambient intelligence. On the computational side, we show that several decision and construction problems which are known to be polynomial time solvable in finite afs are decidable in the context of the proposed formalism and we provide the relevant algorithms. Moreover we obtain additional results concerning the case of finitary afs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。