Computing preferred extensions in abstract argumentation: a SAT-based approach

DOI10.1007/978-3-642-54373-9_12zbMATH Open1405.68344arXiv1310.4986OpenAlexW1494461081MaRDI QIDQ5405019FDOQ5405019

Authors: Federico Cerutti, Massimiliano Giacomin, Mauro Vallati, Paul E. Dunne 

Publication date: 31 March 2014

Published in: Theory and Applications of Formal Argumentation (Search for Journal in Brave)

Abstract: This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances. The approach is based on the idea of reducing the problem of computing complete extensions to a SAT problem and then using a depth-first search method to derive preferred extensions. The proposed approach has been tested using two distinct SAT solvers and compared with three state-of-the-art systems for preferred extension computation. It turns out that the proposed approach delivers significantly better performances in the large majority of the considered cases.

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

Recommendations

• New stochastic local search approaches for computing preferred extensions of abstract argumentation
• Advanced SAT techniques for abstract argumentation
• On computing the set of acceptable arguments in abstract argumentation
• On the computation of Top-\(k\) extensions in abstract argumentation frameworks
• Complexity-sensitive decision procedures for abstract argumentation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)

Cited In (13)

• Reduction-based approaches to implement Modgil's extended argumentation frameworks
• How we designed winning algorithms for abstract argumentation and which insight we attained
• On the computation of Top-\(k\) extensions in abstract argumentation frameworks
• Pakota: a system for enforcement in abstract argumentation
• Enumeration of preferred extensions in almost oriented digraphs
• Looking-ahead in backtracking algorithms for abstract argumentation
• New stochastic local search approaches for computing preferred extensions of abstract argumentation
• Advanced SAT techniques for abstract argumentation
• On the impact of configuration on abstract argumentation automated reasoning
• Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations
• The first international competition on computational models of argumentation: results and analysis
• Dynamic epistemic logics for abstract argumentation
• Methods for solving reasoning problems in abstract argumentation -- a survey

This page was built for publication: Computing preferred extensions in abstract argumentation: a SAT-based approach

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