Complexity of Abstract Argumentation
暂无分享,去创建一个
[1] Paul E. Dunne,et al. The computational complexity of ideal semantics , 2009, Artif. Intell..
[2] Yoshi Ikura. Network optimization practice: A Computational Guide, by D. K. Smith, John Wiley, New York, 1982, 237 pp. Price: $59.95 , 1984, Networks.
[3] Bernhard Nebel,et al. Preferred Arguments are Harder to Compute than Stable Extension , 1999, IJCAI.
[4] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[5] C. Y. Tang,et al. Solving the Satisfiability Problem by Using Randomized Approach , 1992, Inf. Process. Lett..
[6] Christos H. Papadimitriou,et al. The even-path problem for graphs and digraphs , 1984, Networks.
[7] Paul E. Dunne,et al. Computational properties of argument systems satisfying graph-theoretic constraints , 2007, Artif. Intell..
[8] Ioan Tomescu,et al. Almost all digraphs have a kernel , 1990, Discret. Math..
[9] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[10] Henry Prakken,et al. Credulous and Sceptical Argument Games for Preferred Semantics , 2000, JELIA.
[11] Martin Caminada. An Algorithm for Computing Semi-stable Semantics , 2007, ECSQARU.
[12] Trevor J. M. Bench-Capon,et al. Two party immediate response disputes: Properties and efficiency , 2003, Artif. Intell..
[13] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..
[14] Martin Caminada,et al. Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks , 2008, JELIA.
[15] Nadia Creignou,et al. The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness , 1995, Theor. Comput. Sci..
[16] Gerhard Gentzen,et al. Investigations into Logical Deduction , 1970 .
[17] Paolo Mancarella,et al. Computing ideal sceptical argumentation , 2007, Artif. Intell..
[18] Aviezri S. Fraenkel,et al. Planar kernel and grundy with d≤3, dout≤2, din≤2 are NP-complete , 1981, Discret. Appl. Math..
[19] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[20] Bernhard Nebel,et al. Finding Admissible and Preferred Arguments Can be Very Hard , 2000, KR.
[21] Trevor J. M. Bench-Capon,et al. Audiences in argumentation frameworks , 2007, Artif. Intell..
[22] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[23] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[24] Bernhard Nebel,et al. On the computational complexity of assumption-based argumentation for default reasoning , 2002, Artif. Intell..
[25] Paul E. Dunne,et al. The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks , 2008, COMMA.
[26] Pierre Marquis,et al. Symmetric Argumentation Frameworks , 2005, ECSQARU.
[27] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[28] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[29] Paul E. Dunne,et al. Semi-stable semantics , 2006, J. Log. Comput..
[30] M. E. Szabo,et al. The collected papers of Gerhard Gentzen , 1969 .
[31] Richard Chang,et al. On Unique Satisfiability and the Threshold Behavior of Randomized Reductions , 1995, J. Comput. Syst. Sci..
[32] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[33] Yannis Dimopoulos,et al. Graph theoretical structures in logic programs and default theories , 1996 .
[34] Phan Minh Dung,et al. On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..
[35] Trevor J. M. Bench-Capon,et al. Complexity in Value-Based Argument Systems , 2004, JELIA.
[36] Richard Chang,et al. On computing Boolean connectives of characteristic functions , 1995, Mathematical systems theory.
[37] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[38] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.
[39] Celia Wrathall,et al. Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[40] Trevor J. M. Bench-Capon,et al. Coherence in finite argument systems , 2002, Artif. Intell..
[41] Alasdair Urquhart. The Complexity of Gentzen Systems for Propositional Logic , 1989, Theor. Comput. Sci..
[42] Phan Minh Dung,et al. An Abstract, Argumentation-Theoretic Approach to Default Reasoning , 1997, Artif. Intell..
[43] Wenceslas Fernandez de la Vega. Kernels in random graphs , 1990, Discret. Math..
[44] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..
[45] Pierre Marquis,et al. Prudent semantics for argumentation frameworks , 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).
[46] Bruno Courcelle,et al. The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues , 1992, RAIRO Theor. Informatics Appl..
[47] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.