Defeasible Dialectics: A Controversy-Oriented Approach Towards Defeasible Argumentation

نویسنده

  • Gerard Vreeswijk
چکیده

Defeasible argumentation is concerned with studying plausible but, at the same time, fallible patterns of reasoning. Because plausible arguments can easily be developed, and not all of them can be in force at the same time, the main thrust of the theory is in deriving sound principles for adjudicating among conflicting lines of argumentation. In this paper, we propose to resolve such conflicts by starting an artificial debate. The explanatory notes will consist of a short introduction to ‘traditional’ defeasible argumentation, followed by a brief exposition of the basic ideas of what is called formal defeasible dialectics here. The paper will be concluded by proving the traditional and dialectic approach to be equivalent. Research area 1985 Mathematics subject classification 68C01; 1987 CR classification scheme F.4.0, I.2.3, key words and phrases: nonmonotonic reasoning, defeasible dialectics, abstract argumentation system.

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

ثبت نام

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

منابع مشابه

Argument-based User Support Systems using Defeasible Logic Programming

Over the last few years, argumentation has been gaining increasing importance in several AI-related areas, mainly as a vehicle for facilitating rationally justifiable decision making when handling incomplete and potentially inconsistent information. In this setting, user support systems can rely on argumentation techniques to automatize reasoning and decision making in several situations such a...

متن کامل

A first approach to argument-based recommender systems based on defeasible logic programming

Recommender systems have evolved in the last years as specialized tools to assist users in a plethora of computermediated tasks by providing guidelines or hints. Most recommender systems are aimed at facilitating access to relevant items, a situation particularly common when performing web-based tasks. At the same time, defeasible argumentation has evolved as a successful approach in AI to mode...

متن کامل

Recommender System Technologies based on Argumentation 1

In recent years there has been a wide-spread evolution of support tools that help users to accomplish a range of computer-mediated tasks. In this context, recommender systems have emerged as powerful user-support tools which provide assistance to users by facilitating access to relevant items. Nevertheless, recommender system technologies suffer from a number of limitations, mainly due to the l...

متن کامل

Modeling Defeasible Argumentation within a Possibilistic Logic Framework with Fuzzy Unification

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at object-language level. This paper presents a first approach towards extending P-DeLP to incorporate fuzzy constants and fuzzy propositional variables. We focus on how to characteri...

متن کامل

An Approach for Argumentation-based Reasoning Using Defeasible Logic in Multi-Agent Programming Languages

Argumentation systems are intimately related to nonmonotonic reasoning, of which defeasible reasoning is one widely-known approach. For example, the literature points out defeasible logic (a particular formalisation of defeasible reasoning) as a practical platform upon which to develop an argumentation system. In this paper, we develop an approach to endow AgentSpeak agents with argumentative c...

متن کامل

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


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

عنوان ژورنال:
  • J. Log. Comput.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1993