Reasoning about preferences in argumentation frameworks

被引:248
|
作者
Modgil, Sanjay [1 ]
机构
[1] Kings Coll London, Dept Comp Sci, London WC2R 2LS, England
关键词
Argumentation; Dung; Preferences; Non-monotonic reasoning; Logic programming; SEMANTICS;
D O I
10.1016/j.artint.2009.02.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The abstract nature of Dung's seminal theory of argumentation accounts for its widespread application as a general framework for various species of non-monotonic reasoning, and, more generally, reasoning in the presence of conflict. A Dung argumentation framework is instantiated by arguments and a binary conflict based attack relation, defined by some underlying logical theory. The justified arguments under different extensional semantics are then evaluated, and the claims of these arguments define the inferences of the underlying theory. To determine a unique set of justified arguments often requires a preference relation on arguments to determine the success of attacks between arguments. However, preference information is often itself defeasible, conflicting and so subject to argumentation. Hence, in this paper we extend Dung's theory to accommodate arguments that claim preferences between other arguments, thus incorporating meta-level argumentation based reasoning about preferences in the object level. We then define and study application of the full range of Dung's extensional semantics to the extended framework, and study special classes of the extended framework. The extended theory preserves the abstract nature of Dung's approach, thus aiming at a general framework for non-monotonic formalisms that accommodate defeasible reasoning about as well as with preference information. We illustrate by formalising argument based logic programming with defeasible priorities in the extended theory. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:901 / 934
页数:34
相关论文
共 50 条
  • [1] Reasoning about Preferences in Structured Extended Argumentation Frameworks
    Modgil, Sanjay
    Prakken, Henry
    COMPUTATIONAL MODELS OF ARGUMENT: PROCEEDINGS OF COMMA 2010, 2010, 216 : 347 - 358
  • [2] An abstract theory of argumentation that accommodates defeasible reasoning about preferences
    Modgil, Sanjay
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDINGS, 2007, 4724 : 648 - 659
  • [3] Counterfactual Reasoning in Argumentation Frameworks
    Sakama, Chiaki
    COMPUTATIONAL MODELS OF ARGUMENT, 2014, 266 : 385 - 396
  • [4] On the role of preferences in argumentation frameworks
    Amgoud, Leila
    Vesic, Srdjan
    22ND INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2010), PROCEEDINGS, VOL 1, 2010,
  • [5] Reasoning with Metalevel Argumentation Frameworks in Aspartix
    Kokciyan, Nadin
    Sassoon, Isabel
    Young, Anthony P.
    Modgil, Sanjay
    Parsons, Simon
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2018), 2018, 305 : 463 - 464
  • [6] Probabilistic Reasoning with Abstract Argumentation Frameworks
    Hunter, Anthony
    Thimm, Matthias
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 59 : 565 - 611
  • [7] Argumentation-Based Reasoning with Preferences
    Cyras, Kristijonas
    HIGHLIGHTS OF PRACTICAL APPLICATIONS OF SCALABLE MULTI-AGENT SYSTEMS, 2016, 616 : 199 - 210
  • [8] HANDLING PREFERENCES IN ARGUMENTATION FRAMEWORKS WITH NECESSITIES
    Boudhar, Imane
    Nouioua, Farid
    Risch, Vincent
    ICAART: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2012, : 340 - 345
  • [9] Argumentation for Reasoning with Conflicting Clinical Guidelines and Preferences
    Cyras, Kristijonas
    Oliveira, Tiago
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 631 - 632
  • [10] Reasoning about actions and change in argumentation
    Hadjisoteriou, E.
    Kakas, A.
    ARGUMENT & COMPUTATION, 2016, 6 (03) : 265 - 291