Dialectic proof procedures for assumption-based, admissible argumentation
نویسندگان
چکیده
منابع مشابه
Dialectic proof procedures for assumption-based, admissible argumentation
We present a family of dialectic proof procedures for the admissibility semantics of assumptionbased argumentation. These proof procedures are defined for any conventional logic formulated as a collection of inference rules and show how any such logic can be extended to a dialectic argumentation system. The proof procedures find a set of assumptions, to defend a given belief, by starting from a...
متن کاملDialectic proof procedures for assumption - based , admissible argumen - tation 6 July 2005
We present a family of dialectic proof procedures for the admissibility semantics of assumption-based argumentation. These proof procedures are defined for any conventional logic formulated as a collection of inference rules and show how any such logic can be extended to a dialectic argumentation system. The proof procedures find a set of assumptions, to defend a given belief, by starting from ...
متن کاملDialectic proof procedures for assumption - based , admissible argumen - tation 3 February 2005
We present a family of dialectic proof procedures for the admissibility semantics of assumption-based argumentation. These proof procedures are defined for any conventional logic formulated as a collection of inference rules and show how any such logic can be extended to a dialectic argumentation system. The proof procedures find a set of assumptions, to defend a given belief, by starting from ...
متن کاملA dialectic procedure for sceptical, assumption-based argumentation
We present a procedure for computing the sceptical “ideal semantics” for argumentation in assumption-based frameworks. This semantics was first proposed for logic programming in [1], extending the well-founded semantics. The proof procedure is defined by means of a form of dispute derivations, obtained by modifying the dispute derivations given in [2] for computing credulous admissible argument...
متن کاملArgumentation-theoretic proof procedures for default reasoning
We present a succession of presentations of an argumentation-theoretic proof procedure that applies uniformly to a wide variety of logics for default reasoning, including Theorist, default logic, logic programming, autoepistemic logic, non-monotonic modal logic and certain instances of circumscription. The proof procedure can be viewed as conducting a dispute, which is a sequence of alternating...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2006
ISSN: 0004-3702
DOI: 10.1016/j.artint.2005.07.002