2020 · 17 citations · 24 references
ComputingComputer ScienceAlgorithmsKnowledge RepresentationUncertainty QuantificationArgumentationArgumentation TheoryAutomated ReasoningUncertainty ReasoningAbstraction RefinementBoolean SatisfiabilityBoolean Satisfiability ProblemComputational Complexity Of AlgorithmsCounterexample-guided Abstraction RefinementFormal ArgumentationNp-hardnessSatisfiability
Control argumentation frameworks (CAFs) allow for modeling uncertainties inherent in various argumentative settings. We establish a complete computational complexity map of the central computational problem of controllability in CAFs for five key semantics. We also develop Boolean satisfiability based counterexample-guided abstraction refinement algorithms and direct encodings of controllability as quantified Boolean formulas, and empirically evaluate their scalability on a range of NP-hard variants of controllability.
24
Counterexample-guided abstraction refinement for symbolic model checking
Edmund M. Clarke, Orna Grümberg, Somesh Jha et al. · Journal of the ACM · 2003 · 991 citations
Coherence in finite argument systems
Paul E. Dunne, Trevor Bench‐Capon · Artificial Intelligence · 2002 · 202 citations
On the merging of Dung's argumentation systems
Sylvie Coste-Marquis, Caroline Devred, Sébastien Konieczny et al. · Artificial Intelligence · 2007 · 161 citations