메뉴 건너뛰기




Volumn 4, Issue 3-4, 1996, Pages 331-368

A dialectical model of assessing conflicting arguments in legal reasoning

Author keywords

Argumentation; Defeasibility; Dialectics; Logic programming; Rule conflicts

Indexed keywords

FORMAL LOGIC; LOGIC PROGRAMMING;

EID: 0030234961     PISSN: 09248463     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00118496     Document Type: Article
Times cited : (245)

References (48)
  • 3
    • 0002575567 scopus 로고
    • Reasoning about priorities in default logic
    • Seattle
    • Brewka, G. 1994a. Reasoning about priorities in default logic. Proceedings AAAI-94, 247-260. Seattle.
    • (1994) Proceedings AAAI-94 , pp. 247-260
    • Brewka, G.1
  • 4
    • 0141686313 scopus 로고
    • A logical reconstruction of Rescher's theory of formal disputation based on default logic
    • Amsterdam: Wiley
    • Brewka, G. 1994b. A logical reconstruction of Rescher's theory of formal disputation based on default logic. Proceedings of the 11th European Conference on Artificial Intelligence, 366-370. Amsterdam: Wiley.
    • (1994) Proceedings of the 11th European Conference on Artificial Intelligence , pp. 366-370
    • Brewka, G.1
  • 5
    • 0029678885 scopus 로고    scopus 로고
    • Well-founded semantics for extended logic programs with dynamic preferences
    • Brewka, G. 1996. Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research 4, 19-36.
    • (1996) Journal of Artificial Intelligence Research , vol.4 , pp. 19-36
    • Brewka, G.1
  • 6
    • 0009338020 scopus 로고
    • An argumentation semantics for logic programming with explicit negation
    • 1993, MIT Press
    • Dung, P.M. 1993. An argumentation semantics for logic programming with explicit negation. Proceedings of the Tenth Logic Programming Conference, 1993, 616-630. MIT Press.
    • (1993) Proceedings of the Tenth Logic Programming Conference , pp. 616-630
    • Dung, P.M.1
  • 8
    • 0029368659 scopus 로고
    • On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and n-person games
    • Dung, P.M. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and n-person games. Artificial Intelligence 77, 321-357.
    • (1995) Artificial Intelligence , vol.77 , pp. 321-357
    • Dung, P.M.1
  • 10
    • 0026821714 scopus 로고
    • Conditional entailment: Bridging two approaches to default reasoning
    • Geffner, H. and Pearl, J. 1992. Conditional entailment: bridging two approaches to default reasoning. Artificial Intelligence 53, 209-244.
    • (1992) Artificial Intelligence , vol.53 , pp. 209-244
    • Geffner, H.1    Pearl, J.2
  • 11
    • 0003168575 scopus 로고
    • The Pleadings Game: An Exercise in Computational Dialectics
    • Gordon, T.F. 1994. The Pleadings Game: An Exercise in Computational Dialectics. Artificial Intelligence and Law 2: 239-292.
    • (1994) Artificial Intelligence and Law , vol.2 , pp. 239-292
    • Gordon, T.F.1
  • 16
    • 0025404066 scopus 로고
    • A skeptical theory of inheritance in non-monotonic semantic networks
    • Horty, J.F., Thomasson, R.H. & Touretzky, D.S. 1990. A skeptical theory of inheritance in non-monotonic semantic networks. Artificial Intelligence 42, 311-348.
    • (1990) Artificial Intelligence , vol.42 , pp. 311-348
    • Horty, J.F.1    Thomasson, R.H.2    Touretzky, D.S.3
  • 18
    • 0009346927 scopus 로고
    • A fixed points semantics for ordered logic
    • Laenens. E. & Vermeir, D. 1990. A fixed points semantics for ordered logic. Journal of Logic and Computation Vol. 1 No. 2, 159-185.
    • (1990) Journal of Logic and Computation , vol.1 , Issue.2 , pp. 159-185
    • Laenens, E.1    Vermeir, D.2
  • 20
    • 84990576500 scopus 로고
    • Defeat among arguments: A system of defeasible inference
    • Loui, R.P. 1987. Defeat among arguments: a system of defeasible inference. Computational Intelligence 2, 100-106.
    • (1987) Computational Intelligence , vol.2 , pp. 100-106
    • Loui, R.P.1
  • 25
    • 0008204591 scopus 로고
    • Technical Report LRP-TR-13, Laboratory for Computer Science Research, Rutgers University, 1982
    • McCarty, L.T. & Sridharan, N.N. 1982. A computational theory of legal argument. Technical Report LRP-TR-13, Laboratory for Computer Science Research, Rutgers University, 1982.
    • (1982) A Computational Theory of Legal Argument
    • McCarty, L.T.1    Sridharan, N.N.2
  • 27
    • 77956949047 scopus 로고
    • A decidable quantified defeasible logic
    • D. Prawitz, B. Skyrms and D. Westerstahl (eds.): Elsevier Science B. V., 1994
    • Nute, D.N. 1994. A decidable quantified defeasible logic. In D. Prawitz, B. Skyrms and D. Westerstahl (eds.): Logic, Methodology and Philosophy of Science IX. Elsevier Science B. V., 1994, 263-284.
    • (1994) Logic, Methodology and Philosophy of Science IX , pp. 263-284
    • Nute, D.N.1
  • 33
    • 0029180097 scopus 로고
    • On the relation between legal language and legal argument: Assumptions, applicability and dynamic priorities
    • College Park, MD: ACM Press
    • Prakken, H. & Sartor, G. 1995. On the relation between legal language and legal argument: assumptions, applicability and dynamic priorities. Proceedings of the Fifth International Conference on Artificial Intelligence and Law, 1-9. College Park, MD: ACM Press.
    • (1995) Proceedings of the Fifth International Conference on Artificial Intelligence and Law , pp. 1-9
    • Prakken, H.1    Sartor, G.2
  • 34
    • 84947909175 scopus 로고    scopus 로고
    • A system for defeasible argumentation, with defeasible priorities
    • Proceedings of the International Conference on Formal Aspects of Practical Reasoning, Bonn: Springer Verlag
    • Prakken & Sartor, G. 1996a. A system for defeasible argumentation, with defeasible priorities. Proceedings of the International Conference on Formal Aspects of Practical Reasoning, Springer Lecture Notes in AI 1085, 510-524. Bonn: Springer Verlag.
    • (1996) Springer Lecture Notes in AI 1085 , pp. 510-524
    • Prakken1    Sartor, G.2
  • 35
    • 25444503748 scopus 로고    scopus 로고
    • Argument-based extended logic programming with defeasible priorities
    • Prakken & Sartor, G. 1996b. Argument-based extended logic programming with defeasible priorities. To appear in Journal of Applied Non-classical Logics.
    • (1996) Journal of Applied Non-classical Logics
    • Prakken1    Sartor, G.2
  • 41
    • 0342429143 scopus 로고    scopus 로고
    • A formal model of legal argumentation
    • Sartor, G. A formal model of legal argumentation. Ratio Juris 7, 212-226.
    • Ratio Juris , vol.7 , pp. 212-226
    • Sartor, G.1
  • 42
    • 0026817743 scopus 로고
    • A mathematical treatment of defeasible argumentation and its implementation
    • Simari, G.R. & R.P. Loui, R.P. 1992. A mathematical treatment of defeasible argumentation and its implementation. Artificial Intelligence 53, 125-157.
    • (1992) Artificial Intelligence , vol.53 , pp. 125-157
    • Simari, G.R.1    Loui, R.P.2
  • 46
    • 0040324284 scopus 로고    scopus 로고
    • Defeasible dialectics: A controversy-oriented approach towards defeasible argumentation
    • Vreeswijk, G. Defeasible dialectics: a controversy-oriented approach towards defeasible argumentation. Journal of Logic and Computation, Vol. 3, No. 3, 317-334.
    • Journal of Logic and Computation , vol.3 , Issue.3 , pp. 317-334
    • Vreeswijk, G.1


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