메뉴 건너뛰기




Volumn 175, Issue 2, 2011, Pages 457-486

Weighted argument systems: Basic definitions, algorithms, and complexity results

Author keywords

Argumentation; Computational complexity; Handling inconsistency

Indexed keywords

ABSTRACT ARGUMENTS; ARGUMENT SYSTEMS; ARGUMENTATION; ARGUMENTATION FRAMEWORKS; COMPLEXITY RESULTS; HANDLING INCONSISTENCY; NATURAL EXTENSION; RELATIVE STRENGTH;

EID: 78650933145     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2010.09.005     Document Type: Article
Times cited : (320)

References (50)
  • 5
    • 69049119347 scopus 로고    scopus 로고
    • Encompassing attacks to attacks in abstract argumentation frameworks
    • Proc. ECSQARU Springer-Verlag Berlin, Germany
    • P. Baroni, F. Cerutti, M. Giacomin, and G. Guida Encompassing attacks to attacks in abstract argumentation frameworks Proc. ECSQARU LNAI vol. 5590 2009 Springer-Verlag Berlin, Germany 83 94
    • (2009) LNAI , vol.5590 , pp. 83-94
    • Baroni, P.1    Cerutti, F.2    Giacomin, M.3    Guida, G.4
  • 7
    • 78049299048 scopus 로고    scopus 로고
    • Resolution-based argumentation semantics
    • Proc. 2nd COMMA IOS Press
    • P. Baroni, and M. Giacomin Resolution-based argumentation semantics Proc. 2nd COMMA FAIA vol. 172 2008 IOS Press
    • (2008) FAIA , vol.172
    • Baroni, P.1    Giacomin, M.2
  • 9
    • 36849056581 scopus 로고    scopus 로고
    • Temporal dynamics of support and attack networks: From argumentation to zoology
    • Springer-Verlag Berlin, Germany
    • H. Barringer, D.M. Gabbay, and J. Woods Temporal dynamics of support and attack networks: From argumentation to zoology Mechanizing Mathematical Reasoning LNCS vol. 2605 2005 Springer-Verlag Berlin, Germany 59 98
    • (2005) LNCS , vol.2605 , pp. 59-98
    • Barringer, H.1    Gabbay, D.M.2    Woods, J.3
  • 10
    • 0041340842 scopus 로고    scopus 로고
    • Persuasion in practical argument using value based argumentation frameworks
    • T.J.M. Bench-Capon Persuasion in practical argument using value based argumentation frameworks Journal of Logic and Computation 13 3 2003 429 448
    • (2003) Journal of Logic and Computation , vol.13 , Issue.3 , pp. 429-448
    • Bench-Capon, T.J.M.1
  • 12
    • 26944461050 scopus 로고    scopus 로고
    • Inconsistency Tolerance
    • L. Bertossi, A. Hunter, T. Schaub, Springer-Verlag Berlin, Germany
    • L. Bertossi, A. Hunter, T. Schaub, Inconsistency Tolerance LNCS vol. 3300 2004 Springer-Verlag Berlin, Germany
    • (2004) LNCS , vol.3300
  • 14
    • 0032330820 scopus 로고    scopus 로고
    • Functions computable with nonadaptive queries to np
    • H. Burhrman, J. Kadin, and T. Thierauf Functions computable with nonadaptive queries to np Th. Comput. Systems 31 1998 77 92
    • (1998) Th. Comput. Systems , vol.31 , pp. 77-92
    • Burhrman, H.1    Kadin, J.2    Thierauf, T.3
  • 16
    • 26944492173 scopus 로고    scopus 로고
    • Symmetric argumentation frameworks
    • LNAI, Springer-Verlag Berlin, Germany
    • S. Coste-Marquis, C. Devred, and P. Marquis Symmetric argumentation frameworks Proc. 8th ECSQARU LNAI vol. 3571 2005 Springer-Verlag Berlin, Germany
    • (2005) Proc. 8th ECSQARU , vol.3571
    • Coste-Marquis, S.1    Devred, C.2    Marquis, P.3
  • 17
    • 0030408302 scopus 로고    scopus 로고
    • Graph theoretical structures in logic programs and default theories
    • Y. Dimopolous, and A. Torres Graph theoretical structures in logic programs and default theories Theoretical Computer Science 170 1996 209 244
    • (1996) Theoretical Computer Science , vol.170 , pp. 209-244
    • Dimopolous, Y.1    Torres, A.2
  • 18
    • 85027504336 scopus 로고
    • A possibilistic truth-maintenance system with uncertain justifications, and its application to belief revision
    • D. Dubois, J. Lang, and H. Prade A possibilistic truth-maintenance system with uncertain justifications, and its application to belief revision J.P. Martins, M. Reinfrank, Truth Maintenance Systems Lecture Notes in Computer Science vol. 515 1991 Springer Verlag 87 106
    • (1991) Lecture Notes in Computer Science , vol.515 , pp. 87-106
    • Dubois, D.1    Lang, J.2    Prade, H.3
  • 19
    • 0029368659 scopus 로고
    • On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
    • P.M. Dung On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games Artificial Intelligence 77 1995 321 357
    • (1995) Artificial Intelligence , vol.77 , pp. 321-357
    • Dung, P.M.1
  • 20
    • 34548021202 scopus 로고    scopus 로고
    • Computational properties of argument systems satisfying graph-theoretic constraints
    • P.E. Dunne Computational properties of argument systems satisfying graph-theoretic constraints Artificial Intelligence 171 2007 701 729
    • (2007) Artificial Intelligence , vol.171 , pp. 701-729
    • Dunne, P.E.1
  • 21
    • 84875917671 scopus 로고    scopus 로고
    • The computational complexity of ideal semantics I: Abstract argumentation frameworks
    • FAIA, IOS Press
    • P.E. Dunne The computational complexity of ideal semantics I: Abstract argumentation frameworks Proc. 2nd COMMA FAIA vol. 172 2008 IOS Press 147 158
    • (2008) Proc. 2nd COMMA , vol.172 , pp. 147-158
    • Dunne, P.E.1
  • 22
    • 70350566068 scopus 로고    scopus 로고
    • The computational complexity of ideal semantics
    • P.E. Dunne The computational complexity of ideal semantics Artificial Intelligence 173 2009 1559 1591
    • (2009) Artificial Intelligence , vol.173 , pp. 1559-1591
    • Dunne, P.E.1
  • 24
    • 77949672220 scopus 로고    scopus 로고
    • Computational complexity of semi-stable semantics in abstract argumentation frameworks
    • LNAI, Springer-Verlag Berlin, Germany
    • P.E. Dunne, and M. Caminada Computational complexity of semi-stable semantics in abstract argumentation frameworks Proc. 11th JELIA LNAI vol. 5292 2008 Springer-Verlag Berlin, Germany
    • (2008) Proc. 11th JELIA , vol.5292
    • Dunne, P.E.1    Caminada, M.2
  • 27
    • 78650949569 scopus 로고    scopus 로고
    • Complexity of semi-stable and stage semantics in argumentation frameworks
    • W. Dvorak, and S. Woltran Complexity of semi-stable and stage semantics in argumentation frameworks Inf. Proc. Letters 110 2010 425 430
    • (2010) Inf. Proc. Letters , vol.110 , pp. 425-430
    • Dvorak, W.1    Woltran, S.2
  • 28
    • 0029287977 scopus 로고
    • Computing functions with parallel queries in np
    • B. Jenner, and J. Toran Computing functions with parallel queries in np Theoretical Computer Science 141 1995 175 193
    • (1995) Theoretical Computer Science , vol.141 , pp. 175-193
    • Jenner, B.1    Toran, J.2
  • 29
    • 24044479550 scopus 로고    scopus 로고
    • The complexity of obtaining solutions for problems in np and nl
    • Springer-Verlag Berlin, Germany
    • B. Jenner, and J. Toran The complexity of obtaining solutions for problems in np and nl Complexity Theory Retrospective II 1997 Springer-Verlag Berlin, Germany 155 178
    • (1997) Complexity Theory Retrospective II , pp. 155-178
    • Jenner, B.1    Toran, J.2
  • 34
    • 38049138858 scopus 로고    scopus 로고
    • An abstract theory of argumentation that accommodates defeasible reasoning about preferences
    • LNCS, Springer
    • S. Modgil An abstract theory of argumentation that accommodates defeasible reasoning about preferences Symbolic and Quantitative Approaches to Reasoning with Uncertainty LNCS vol. 4724 2007 Springer
    • (2007) Symbolic and Quantitative Approaches to Reasoning with Uncertainty , vol.4724
    • Modgil, S.1
  • 35
    • 77956041608 scopus 로고    scopus 로고
    • Labellings and games for extended argumentation frameworks
    • S. Modgil, Labellings and games for extended argumentation frameworks, in: Proc. 21st IJCAI, 2009, pp. 873-878.
    • (2009) Proc. 21st IJCAI , pp. 873-878
    • Modgil, S.1
  • 36
    • 64549136645 scopus 로고    scopus 로고
    • Reasoning about preferences in argumentation frameworks
    • S. Modgil Reasoning about preferences in argumentation frameworks Artificial Intelligence 173 9-10 2009 901 934
    • (2009) Artificial Intelligence , vol.173 , Issue.910 , pp. 901-934
    • Modgil, S.1
  • 38
    • 78650961154 scopus 로고
    • Towards solving the multiple extension problem: Combining defaults and probability
    • E. Neufeld, and D. Poole Towards solving the multiple extension problem: combining defaults and probability L.N. Kanal, T.S. Levitt, J.F. Lemmer, Uncertainty in Artificial Intelligence vol. 3 1989 Elsevier Science Publishers Amsterdam, The Netherlands 35 44
    • (1989) Uncertainty in Artificial Intelligence , vol.3 , pp. 35-44
    • Neufeld, E.1    Poole, D.2
  • 41
    • 0346339628 scopus 로고    scopus 로고
    • On precise and correct qualitative probabilistic reasoning
    • S. Parsons On precise and correct qualitative probabilistic reasoning International Journal of Approximate Reasoning 35 2004 111 135
    • (2004) International Journal of Approximate Reasoning , vol.35 , pp. 111-135
    • Parsons, S.1
  • 43
    • 0027702434 scopus 로고
    • Probabilistic horn abduction and Bayesian networks
    • D. Poole Probabilistic horn abduction and Bayesian networks Artificial Intelligence 64 1993 81 129
    • (1993) Artificial Intelligence , vol.64 , pp. 81-129
    • Poole, D.1
  • 48
    • 0002153945 scopus 로고
    • A general non-probabilistic theory of inductive reasoning
    • W. Spohn A general non-probabilistic theory of inductive reasoning R.D. Shachter, T.S. Levitt, L.N. Kanal, J.F. Lemmer, Uncertainty in Artificial Intelligence vol. 4 1990 Elsevier Science Publishers Amsterdam, The Netherlands 149 158
    • (1990) Uncertainty in Artificial Intelligence , vol.4 , pp. 149-158
    • Spohn, W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.