Propositional Argumentation and Causal Reasoning

نویسنده

  • Alexander Bochman
چکیده

The paper introduces a number of propositional argumentation systems obtained by gradually extending the underlying language and associated monotonic logics. An assumption-based argumentation framework [Bondarenko et al., 1997] will constitute a special case of this construction. In addition, a stronger argumentation system in a full classical language will be shown to be equivalent to a system of causal reasoning [Giunchiglia et al., 2004]. The implications of this correspondence for the respective nonmonotonic theories of argumentation and causal reasoning are discussed.

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

ثبت نام

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

منابع مشابه

Propositional Argumentation Systems vs Theorist

Propositional argumentation systems are based on assumption based reasoning and used for computing arguments which support a given hypotheses Assumption based reasoning is closely related to hypothetical default theories or inference through theory formation The latter approach known as the Theorist frame work has well known relations to abduction and default reasoning In this paper proposition...

متن کامل

Argumentation and Propositional Logic

Argumentation has played a significant role in understanding and unifying under a common framework different forms of defeasible reasoning in Artificial Intelligence (AI). Argumentation is also close to the original inception of logic as a framework for formalizing human debate and dialogue. The purpose of this paper is to draw a formal connection between argumentation and classical reasoning, ...

متن کامل

Argumentation for Propositional Logic and Nonmonotonic Reasoning

Argumentation has played a significant role in understanding and unifying under a common framework different forms of defeasible reasoning in AI. Argumentation is also close to the original inception of logic as a framework for formalizing human argumentation and debate. In this context, the purpose of this paper is twofold: to draw a formal connection between argumentation and classical reason...

متن کامل

Representational Succinctness of Abstract Dialectical Frameworks

Representational succinctness is the ability of a formalism with modeltheoretic semantics to express interpretation sets in a space-efficient way. In this paper we analyse the representational succinctness of abstract dialectical frameworks (ADFs) under the two-valued model semantics. We also compare ADFs’ succinctness to related formalisms like propositional logic, argumentation frameworks (un...

متن کامل

A General QBF-based Formalization of abstract Argumentation Theory

We introduce a unified logical approach, based on signed theories and Quantified Boolean Formulas (QBFs), that can serve as a basis for representing and reasoning with various argumentation-based decision problems. By this, we are able to represent, in a uniform and simple way, a wide range of extension-based semantics for argumentation theory, including complete, grounded, preferred, semistabl...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2005