메뉴 건너뛰기




Volumn 482, Issue , 2006, Pages 1-14

Making decisions from weighted arguments

Author keywords

Argumentation; Decision

Indexed keywords


EID: 84998849421     PISSN: 02541971     EISSN: 23093706     Source Type: Book Series    
DOI: 10.1007/3-211-38167-8_1     Document Type: Chapter
Times cited : (3)

References (21)
  • 1
    • 0036949765 scopus 로고    scopus 로고
    • Inferring from inconsistency in preference-based argumentation frameworks
    • L. Amgoud and C. Cayrol. Inferring from inconsistency in preference-based argumentation frameworks. International Journal of Automated Reasoning, Volume 29, N2:125-169, 2002.
    • (2002) International Journal of Automated Reasoning , vol.29 , Issue.2 , pp. 125-169
    • Amgoud, L.1    Cayrol, C.2
  • 8
    • 0028381757 scopus 로고
    • Automated reasoning using possibilistic logic: Semantics, belief revision and variable certainty weights
    • D. Dubois, J. Lang, and H. Prade. Automated reasoning using possibilistic logic: semantics, belief revision and variable certainty weights. IEEE Trans, on Data and Knowledge Engineering, 6:64-71, 1994.
    • (1994) IEEE Trans, on Data and Knowledge Engineering , vol.6 , pp. 64-71
    • Dubois, D.1    Lang, J.2    Prade, H.3
  • 9
    • 85027290069 scopus 로고    scopus 로고
    • Possibility theory as a basis for qualitative decision theory
    • Montreal, August 20-25 1995. Morgan Kaufmann, San Mateo, CA
    • D. Dubois and H. Prade. Possibility theory as a basis for qualitative decision theory. In 14th Inter. Joint Conf. on Artificial Intelligence (IJCAFOS), pages 1924-1930, Montreal, August 20-25 1995. Morgan Kaufmann, San Mateo, CA.
    • 14Th Inter. Joint Conf. on Artificial Intelligence (IJCAFOS) , pp. 1924-1930
    • Dubois, D.1    Prade, H.2
  • 11
    • 0032644406 scopus 로고    scopus 로고
    • Using possibilistic logic for modeling qualitative decision: Atms-based algorithms
    • Didier Dubois, Daniel Le Berre, Henri Prade, and Rgis Sabbadin. Using possibilistic logic for modeling qualitative decision: Atms-based algorithms. Fundamenta Informaticae, 37:1-30, 1999.
    • (1999) Fundamenta Informaticae , vol.37 , pp. 1-30
    • Dubois, D.1    Berre, D.L.2    Prade, H.3    Sabbadin, R.4
  • 12
  • 14
    • 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:321-357, 1995.
    • (1995) Artificial Intelligence , vol.77 , pp. 321-357
    • Dung, P.M.1
  • 19
    • 0025462359 scopus 로고
    • Nonmonotonic reasoning, preferential models and cumulative logics
    • S. Kraus, D. Lehmann, and M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44:167-207, 1990.
    • (1990) Artificial Intelligence , vol.44 , pp. 167-207
    • Kraus, S.1    Lehmann, D.2    Magidor, M.3
  • 20
    • 0026817743 scopus 로고
    • A mathematical treatment of defeasible reasoning and its implementation
    • G. R. Simari and R. P. Loui. A mathematical treatment of defeasible reasoning and its implementation. Artificial Intelligence and Law, 53:125-157, 1992.
    • (1992) Artificial Intelligence and Law , vol.53 , pp. 125-157
    • Simari, G.R.1    Loui, R.P.2


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