Advanced SAT techniques for abstract argumentation

DOI10.1007/978-3-642-40624-9_9zbMATH Open1401.68312OpenAlexW2112598286WikidataQ62040443 ScholiaQ62040443MaRDI QIDQ2851963FDOQ2851963

Authors: Johannes Wallner, Georg Weissenbacher, Stefan Woltran 

Publication date: 4 October 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40624-9_9

Recommendations

• Complexity-sensitive decision procedures for abstract argumentation
• Computing preferred extensions in abstract argumentation: a SAT-based approach
• On computing the set of acceptable arguments in abstract argumentation
• SAT-based approaches to adjusting, repairing, and computing largest extensions of argumentation frameworks
• Argumentation frameworks as constraint satisfaction problems

zbMATH Keywords

propositional satisfiabilityabstract argumentationargumentation systems

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cited In (4)

• How we designed winning algorithms for abstract argumentation and which insight we attained
• Minimal sets on propositional formulae. Problems and reductions
• Computing preferred extensions in abstract argumentation: a SAT-based approach
• Methods for solving reasoning problems in abstract argumentation -- a survey

Uses Software

• Chaff
• Potassco

This page was built for publication: Advanced SAT techniques for abstract argumentation

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