Controllability of Control Argumentation Frameworks
Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo
Abstract
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.
Topics & Concepts
ControllabilitySatisfiabilityTheoretical computer scienceComputer scienceScalabilityAbstractionArgumentation theoryBoolean satisfiability problemCounterexampleComputational complexity theorySemantics (computer science)MathematicsAlgorithmProgramming languageDiscrete mathematicsDatabasePhilosophyEpistemologyApplied mathematicsMulti-Agent Systems and NegotiationLogic, Reasoning, and KnowledgeFormal Methods in Verification