Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation

DOI10.1017/s1471068421000296zbMath1530.68247arXiv2108.04192OpenAlexW3195436951WikidataQ114653852 ScholiaQ114653852MaRDI QIDQ6063862

Tuomo Lehtonen, Johannes Peter Wallner, Matti Järvisalo

Publication date: 12 December 2023

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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

zbMATH Keywords

structured argumentationanswer-set programmingexperimental evaluationassumption-based argumentationincremental answer-set solving

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Argument graphs and assumption-based argumentation
• A generalised framework for dispute derivations in assumption-based argumentation
• An abstract, argumentation-theoretic approach to default reasoning
• Corrigendum to: ``A general account of argumentation with preferences
• On the computational complexity of assumption-based argumentation for default reasoning.
• Logic programs with stable model semantics as a constraint programming paradigm
• From structured to abstract argumentation: assumption-based acceptance via AF reasoning
• Dialectic proof procedures for assumption-based, admissible argumentation
• Counterexample-guided abstraction refinement for symbolic model checking
• On the Equivalence between Assumption-Based Argumentation and Logic Programming
• Declarative Algorithms and Complexity Results for Assumption-Based Argumentation
• Graph-Based Dispute Derivations in Assumption-Based Argumentation