Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach

DOI10.1007/978-3-642-54373-9_12zbMath1405.68344arXiv1310.4986OpenAlexW1494461081MaRDI QIDQ5405019

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

Publication date: 31 March 2014

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

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

Mathematics Subject Classification ID

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

Related Items (11)

Looking-ahead in backtracking algorithms for abstract argumentation ⋮ The first international competition on computational models of argumentation: results and analysis ⋮ On the impact of configuration on abstract argumentation automated reasoning ⋮ Dynamic epistemic logics for abstract argumentation ⋮ Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations ⋮ New stochastic local search approaches for computing preferred extensions of abstract argumentation ⋮ Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks ⋮ Unnamed Item ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained ⋮ Pakota: A System for Enforcement in 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