A QBF-based formalization of abstract argumentation semantics

Amgoud, 2011, Argumentation frameworks as constraint satisfaction problems, vol. 6929, 110 Antoniou, 1997 Arieli, 2007, Paraconsistent reasoning and preferential entailments by signed quantified Boolean formula, ACM Transactions on Computational Logic, 8, 10.1145/1243996.1244001 Arieli, 2012, Conflict-tolerant semantics for argumentation frameworks, vol. 7519, 28 Arieli, 1996, Reasoning with logical bilattices, Journal of Logic, Language, and Information, 5, 25, 10.1007/BF00215626 Arieli, 2012, A general QBF-based framework for formalizing argumentation, vol. 245, 105 Arieli, 2003, Reducing preferential paraconsistent reasoning to classical entailment, Journal of Logic and Computation, 13, 557, 10.1093/logcom/13.4.557 Arieli, 2006, Computational methods for database repair by signed formulae, Annals of Mathematics and Artificial Intelligence, 46, 4, 10.1007/s10472-005-9012-z Arieli, 2010, Similarity-based inconsistency-tolerant logics, vol. 6341, 11 Baroni, 2008, Semantics for abstract argumentation systems, 25 Baroni, 2005, SCC-recursiveness: A general schema for argumentation semantics, Artificial Intelligence, 168, 162, 10.1016/j.artint.2005.05.006 Benedetti, 2008, QBF-based formal verification: Experience and perspectives, Journal on Satisfiability, Boolean Modeling and Computation, 5, 133, 10.3233/SAT190055 Besnard, 2004, Characterization of semantics for argument systems, 183 Ph Besnard, S. Doutre, Checking the acceptability of a set of arguments, in: J.P. Delgrande, T. Schaub (Eds.), Proc. 10th International Workshop on Non-Monotonic Reasoning (NMRʼ04), 2004, pp. 59–64. Besnard, 2002, Paraconsistent reasoning via quantified boolean formulas, Part I: Axiomatizing signed systems, vol. 2424, 320 Besnard, 2003, Paraconsistent reasoning via quantified boolean formulas, Part II: Circumscribing inconsistent theories, vol. 2711, 528 Besnard, 2004, Representing paraconsistent reasoning via quantified propositional logic, vol. 3300, 84 Boella, 2005, A logic of abstract argumentation, vol. 4049, 29 Bondarenko, 1997, An abstract, argumentation-theoretic approach to default reasoning, Artificial Intelligence, 93, 63, 10.1016/S0004-3702(97)00015-5 Caminada, 2006, On the issue of reinstatement in argumentation, vol. 4160, 111 Caminada, 2006, Semi-stable semantics, 121 M.W.A. Caminada, Comparing two unique extension semantics for formal argumentation: ideal and eager, in: M. Mehdi Dastani, E. de Jong (Eds.), Proc. 19th Belgian–Dutch Conference on Artificial Intelligence (BNAICʼ07), 2007, pp. 81–87. Caminada, 2010, An algorithm for stage semantics, 147 M.W.A. Caminada, Preferred semantics as Socratic discussion, in: A.E. Gerevini, A. Saetti (Eds.), Proceedings of the Eleventh AI*IA Symposium on Artificial Intelligence, 2010, pp. 209–216. Caminada, 2011, A labelling approach for ideal and stage semantics, Argument and Computation, 2, 1, 10.1080/19462166.2010.515036 Caminada, 2007, On the evaluation of argumentation formalisms, Artificial Intelligence, 171, 286, 10.1016/j.artint.2007.02.003 Caminada, 2009, A logical account of formal argumentation, Studia Logica, 93, 109, 10.1007/s11225-009-9218-x Caminada, 2011, On judgment aggregation in abstract augmentation, Autonomous Agents and Multi-Agent Systems, 22, 64, 10.1007/s10458-009-9116-7 Caminada, 2012, Grounded semantics as persuasion dialogue, vol. 245, 478 M.W.A. Caminada, B. Verheij, On the existence of semi-stable extensions, in: G. Danoy, M. Seredynski, R. Booth, B. Gateau, I. Jars, D. Khadraoui (Eds.), Proc. 22nd Benelux Conference on Artificial Intelligence (BNAICʼ10), 2010. Caminada, 2009, An argument game of stable semantics, Logic Journal of IGPL, 17, 77, 10.1093/jigpal/jzn029 M.W.A. Caminada, Y. Wu, On the limitations of abstract argumentation, in: P. de Causmaecker, J. Maervoet, T. Messelis, K. Verbeeck, T. Vermeulen (Eds.), Proc. 23rd Benelux Conference on Artificial Intelligence (BNAICʼ11), 2011, pp. 59–66. Caminada, 2012, Semi-stable semantics, Journal of Logic and Computation, 22, 1207, 10.1093/logcom/exr033 Cayrol, 2001, Dialectical proof theories for the credulous preferred semantics of argumentation frameworks, vol. 2143, 668 Cayrol, 2003, On decision problems related to the preferred semantics for argumentation frameworks, Journal of Logic and Computation, 13, 377, 10.1093/logcom/13.3.377 Delgrande, 2004, On computing belief change operations using quantified Boolean formulas, Journal of Logic and Computation, 14, 801, 10.1093/logcom/14.6.801 Dung, 1995, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games, Artificial Intelligence, 77, 321, 10.1016/0004-3702(94)00041-X Dung, 2007, Computing ideal sceptical argumentation, Artificial Intelligence, 171, 642, 10.1016/j.artint.2007.05.003 Dunne, 2007, Computational properties of argument systems satisfying graph-theoretic constraints, Artificial Intelligence, 171, 701, 10.1016/j.artint.2007.03.006 Dunne, 2008, Computational complexity of semi-stable semantics in abstract argumentation frameworks, vol. 5293, 153 Dvořák, 2012, On the complexity of computing the justification status of an argument, vol. 7132, 32 Dvořák, 2010, Complexity of semi-stable and stage semantics in argumentation frameworks, Information Processing Letters, 110, 425, 10.1016/j.ipl.2010.04.005 W. Dvořák, P.E. Dunne, S. Woltran, Parametric properties of ideal semantics, in: Proc. 22nd International Joint Conference on Artificial Intelligence (IJCAIʼ11), 2011, pp. 851–856. Dvořák, 2012, Abstract argumentation via monadic second order logic, vol. 6929, 85 Egly, 2006, Reasoning in argumentation frameworks using quantified boolean formulas, 133 Egly, 2008, ASPARTIX, implementing argumentation frameworks using answer-set programming, vol. 5366, 734 Egly, 2010, Answer-set programming encodings for argumentation frameworks, Argument and Computation, 1, 144, 10.1080/19462166.2010.486479 Gabbay, 2012, An equational approach to CF2 semantics, vol. 245, 141 Gabbay, 2012, Equational approach to argumentation networks, Argument and Computation, 3, 87, 10.1080/19462166.2012.704398 Gelfond, 1988, The stable model semantics for logic programming, 1070 Gelfond, 1991, Classical negation in logic programs and disjunctive databases, New Generation Computing, 9, 365, 10.1007/BF03037169 Gorogiannis, 2011, Instantiating abstract argumentation with classical logic arguments: Postulates and properties, Artificial Intelligence, 175, 1479, 10.1016/j.artint.2010.12.003 Governatori, 2004, Argumentation semantics for defeasible logic, Journal of Logic and Computation, 14, 675, 10.1093/logcom/14.5.675 Grossi, 2010, On the logic of argumentation theory, 409 Grossi, 2011, An application of model checking games to abstract argumentation, vol. 6953, 74 Jakobovits, 1999, Dialectic semantics for argumentation frameworks, 53 Jakobovits, 1999, Robust semantics for argumentation frameworks, Journal of Logic and Computation, 9, 215, 10.1093/logcom/9.2.215 Kleene, 1950 Mangassarian, 2010, Robust QBF encodings for sequential circuits with applications to verification, debug, and test, IEEE Transactions on Computers, 59, 981, 10.1109/TC.2010.74 McCarthy, 1986, Applications of circumscription to formalizing common-sense knowledge, Artificial Intelligence, 28, 89, 10.1016/0004-3702(86)90032-9 S. Modgil, Labellings and games for extended argumentation frameworks, in: Proc. 21st International Joint Conference on Artificial Intelligence (IJCAIʼ09), 2009, pp. 873–878. Pollock, 1992, How to reason defeasibly, Artificial Intelligence, 57, 1, 10.1016/0004-3702(92)90103-5 Pollock, 1995 Prakken, 2010, An abstract framework for argumentation with structured arguments, Argument and Computation, 1, 93, 10.1080/19462160903564592 Prakken, 1997, Argument-based extended logic programming with defeasible priorities, Journal of Applied Non-Classical Logics, 7, 25, 10.1080/11663081.1997.10510900 Reiter, 1980, A logic for default reasoning, Artificial Intelligence, 13, 81, 10.1016/0004-3702(80)90014-4 Rintanen, 1999, Constructing conditional plans by a theorem-prover, Journal of Artificial Intelligence Research, 10, 323, 10.1613/jair.591 Toni, 2011, Argumentation and answer set programming, vol. 6565, 164 van Gelder, 1991, The well-founded semantics for general logic programs, Journal of the ACM, 38, 620, 10.1145/116825.116838 B. Verheij, Two approaches to dialectical argumentation: admissible sets and argumentation stages, in: J.-J.Ch. Meyer, L.C. van der Gaag (Eds.), Proc. 8th Dutch Conference on Artificial Intelligence (NAICʼ96), 1996, pp. 357–368. Verheij, 2003, Dialectical argumentation with argumentation schemes: An approach to legal logic, Artificial Intelligence and Law, 11, 167, 10.1023/B:ARTI.0000046008.49443.36 Wakaki, 2008, Computing argumentation semantics in answer set programming, vol. 5447, 254 E. Weydert, Semi-stable extensions for infinite frameworks, in: P. de Causmaecker, J. Maervoet, T. Messelis, K. Verbeeck, T. Vermeulen (Eds.), Proc. 23rd Benelux Conference on Artificial Intelligence (BNAICʼ11), 2011, pp. 336–343. Wu, 2010, A labelling-based justification status of arguments, Studies in Logics, 3, 12 Wu, 2009, Complete extensions in argumentation coincide with 3-valued stable models in logic programming, Studia Logica, 93, 383, 10.1007/s11225-009-9210-5