DiaLaw: Levels, Dialog Trees, Convincing Arguments

نویسنده

  • Arno R. Lodder
چکیده

DiaLaw is a dialogical model of legal justification. An important characteristic of the formal and implemented model DiaLaw is that both logic-based arguments and mere convincing statements can be modelled. The support of both structural (logic-based) arguments and procedural arguments (mere convincing statements) is expressed by different levels in the dialog. In this paper so-called dialog trees are used to show the connection between the assertions (both structural and procedural arguments) put forward on the different levels in the dialog. Furthermore, a definition of the previously informally introduced procedural argument is given, and procedural arguments are compared with similar features in games like MacKenzie’s DC and Bench-Capon’s TDG. Finally, it is indicated that procedural arguments cannot be defined in the logical layer, but have to be defined in the procedural layer (cf. Prakken’s layered models of argumentation).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Persuasive Argumentation in a Medical Diagnosis Tutoring System

An important problem in intelligent tutoring systems and decision support systems in general concern the implementation of a convincing argumentation dialog between the system and the student or the user. The requirements for a convincing argumentation dialog can vary depending on the kinds of conflicts that arise in the exchanges between the system and the user. In this paper we discuss an app...

متن کامل

Recovering Empty Arguments in Korean

This paper looks at empty arguments in Korean, and the constraints that can be used in recovering their meaning, or referent. We look at scrambling to provide insights into the process by which empty arguments can be recovered, and provide a computational algorithm based on local and global information that takes advantage of the semantic restrictions placed by the verb. We look at recovering e...

متن کامل

On Structure and Naturalness in Dialogical Models of Argumentation

It is recognized by researches from various disciplines (e.g.: informal logic, artificial intelligence & law, legal theory, computational dialectics) that argumentation is a process and that this process can adequately be modeled by means of a dialog. This paper evaluates three of these dialogical models: the best-known in general (MacKenzie’s DC), the best-known in AI & Law (The Pleadings Game...

متن کامل

Probabilistic Dialog Management

Modeling user interfaces as dialogs provides a conceptual framework to address global coherence and efficiency of interactions. While non-probabilistic approaches provide convincing results and transparent dialog behavior, probabilistic techniques can help to account for inherent uncertainties in user input. In this paper, we present three patterns for probabilistic dialog management or support...

متن کامل

ARGUER: Using Argument Schemas for Argument Detection and Rebuttal in Dialogs∗

This paper presents a computational method for argumentation on the basis of a declarative characterization of the structure of arguments. The method can be used to implement a computational agent that is both able to detect arguments and to generate candidate arguments for rebuttal. The method makes no a priori assumptions about attack and support relations between propositions that are advanc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000