Automata for infinite argumentation structures

DOI10.1016/J.ARTINT.2013.05.002MaRDI QIDQ2351042zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin

Publication date 26 June 2015

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.04892

zbMATH Keywords

argumentation semantics computationautomata-based representationinfinite argumentation frameworks

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in artificial intelligence (68T27)

Abstract: 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.

Recommendations

• Infinite argumentation frameworks. On the existence and uniqueness of extensions
• Abstract argumentation systems
• Computation in extended argumentation frameworks
• Theory of semi-instantiation in abstract argumentation
• scientific article; zbMATH DE number 6747868

Cited in

(7)

• On the impact of configuration on abstract argumentation automated reasoning
• How we designed winning algorithms for abstract argumentation and which insight we attained
• A general approach to extension-based semantics in abstract argumentation
• scientific article; zbMATH DE number 7238899 (Why is no real title available?)
• Infinite argumentation frameworks. On the existence and uniqueness of extensions
• Necessary and sufficient conditions of the enforcement problem for various argumentation semantics
• Complexity in infinite argumentation with structural constraints

This page was built for publication: Automata for infinite argumentation structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2351042)